LGDGMay 11

Kernel-Gradient Drifting Models

arXiv:2605.1072781.11 citations
Predicted impact top 14% in LG · last 90 daysOriginality Highly original
AI Analysis

Provides a principled extension of drifting models to non-Euclidean data (manifolds, discrete) with theoretical guarantees, addressing a key limitation of prior work.

Kernel-gradient drifting replaces fixed Euclidean drift with kernel-induced directions, enabling one-step generative modeling that achieves state-of-the-art results on spherical geospatial data, promoter DNA, and molecule generation without distillation.

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 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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes