Skip to content
DraconiticResearch
Search Sources API
194,164 studies31 sourcesUpdated 29 min ago
PreprintCC BY 4.0arXiv

Kernel-Gradient Drifting Models

Abstract

We propose kernel-gradient drifting, a one-step generative modeling framework that replaces the fixed Euclidean displacement direction in drifting models with directions induced by the kernel itself. Standard drifting is attractive because it enables fast, high-quality generation without distilling a large pretrained diffusion model, but its theory is currently understood mainly for Gaussian kernels, where the drift coincides with smoothed score matching and is identifiable. Our gradient-based reformulation exposes this score-based structure for general kernels: the resulting drift is the score difference between kernel-smoothed data and model distributions, yielding identifiability for characteristic kernels and a smoothed-KL descent interpretation of the smoothed drifting dynamics. Since kernel gradients are intrinsic tangent vectors, the same construction extends naturally to Riemannian manifolds and to discrete data via the Fisher-Rao geometry of the probability simplex. Across spherical geospatial data, promoter DNA and molecule generation, kernel-gradient drifting enables state-of-the-art one-step generation beyond the Euclidean setting without distillation. Code is available \href{https://github.com/jcarrascopollo/kgd_thesis}{here}.

Related

  1. Gauss-Newton drifting extends natural gradient descent
    Théo Dumont, Théo Lacombe, François-Xavier Vialard
    HALPreprintCC BY-NC-SA 4.0Full textOptimisation & controlHALarXiv
  2. Gradient estimates for the Green kernel under spectral Ricci bounds, and the stable Bernstein theorem in ℝ⁴
    Xavier Cabré, Giovanni Catino, Luciano Mari +2
    Transactions of the American Mathematical SocietyPeer-reviewedLicence not statedFull text10 citedGeneral mathematicsOpenAlex
  3. A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting
    Clément Dombry, Jean-Jil Duchamps
    HALPreprintCC BY 4.0Full textProbabilityStatisticsHALarXiv
  4. Generalization Analysis of Distributed Kernel-based Robust Gradient Descent Algorithms
    Jun-Yi Meng, Zheng-Chu Guo, Yuan Mao
    arXivPreprintarXiv licenceFull textAnalysis & PDEsProbabilityarXiv
  5. Kernel representations of fractional gradient bilinear forms. Part I. Constant coefficients
    Serena Dipierro, Caterina Sportelli, Enrico Valdinoci
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{estebancasadevall2026kernelgradient,
  title = {{Kernel-Gradient Drifting Models}},
  author = {Maria Esteban-Casadevall and Jorge Carrasco-Pollo and Max Welling and Jan-Willem van de Meent and Erik J. Bekkers and Floor Eijkelboom},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2605.10727},
  eprint = {2605.10727},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.10727},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Kernel-Gradient Drifting Models
AU  - Maria Esteban-Casadevall
AU  - Jorge Carrasco-Pollo
AU  - Max Welling
AU  - Jan-Willem van de Meent
AU  - Erik J. Bekkers
AU  - Floor Eijkelboom
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2605.10727
UR  - https://arxiv.org/abs/2605.10727
AB  - We propose kernel-gradient drifting, a one-step generative modeling framework that replaces the fixed Euclidean displacement direction in drifting models with directions induced by the kernel itself. Standard drifting is attractive because it enables fast, high-quality generation without distilling a large pretrained diffusion model, but its theory is currently understood mainly for Gaussian kernels, where the drift coincides with smoothed score matching and is identifiable. Our gradient-based reformulation exposes this score-based structure for general kernels: the resulting drift is the score difference between kernel-smoothed data and model distributions, yielding identifiability for characteristic kernels and a smoothed-KL descent interpretation of the smoothed drifting dynamics. Since kernel gradients are intrinsic tangent vectors, the same construction extends naturally to Riemannian manifolds and to discrete data via the Fisher-Rao geometry of the probability simplex. Across spherical geospatial data, promoter DNA and molecule generation, kernel-gradient drifting enables state-of-the-art one-step generation beyond the Euclidean setting without distillation. Code is available \href{https://github.com/jcarrascopollo/kgd_thesis}{here}.
ER  -