ExplorerArtificial IntelligenceAI
Research PaperResearchia:202605.22003

Finite-Particle Convergence Rates for Conservative and Non-Conservative Drifting Models

Krishnakumar Balasubramanian

Abstract

We propose and analyze a conservative drifting method for one-step generative modeling. The method replaces the original displacement-based drifting velocity by a kernel density estimator (KDE)-gradient velocity, namely the difference of the kernel-smoothed data score and the kernel-smoothed model score. This velocity is a gradient field, addressing the non-conservatism issue identified for general displacement-based drifting fields. We prove continuous-time finite-particle convergence bounds fo...

Submitted: May 22, 2026Subjects: AI; Artificial Intelligence

Description / Details

We propose and analyze a conservative drifting method for one-step generative modeling. The method replaces the original displacement-based drifting velocity by a kernel density estimator (KDE)-gradient velocity, namely the difference of the kernel-smoothed data score and the kernel-smoothed model score. This velocity is a gradient field, addressing the non-conservatism issue identified for general displacement-based drifting fields. We prove continuous-time finite-particle convergence bounds for the conservative method on Rd\R^d: a joint-entropy identity yields bounds for the empirical Stein drift, the smoothed Fisher discrepancy of the KDE, and the squared center velocity. The main finite-particle correction is a reciprocal-KDE self-interaction term, and we give deterministic and high-probability local-occupancy conditions under which this term is controlled. We keep the quadrature constants explicit and track their possible bandwidth dependence: the root residual-velocity rate N1/(d+4)N^{-1/(d+4)} holds under an additional hh-uniform quadrature regularity condition, while a more general growth condition yields the optimized root rate N(2β)/(2(d+4β))N^{-(2-β)/(2(d+4-β))}, where 0β<20\le β<2. We also analyze the non-conservative drifting method with Laplace kernel, corresponding to the original displacement-based velocity proposed in~\cite{deng2026drifting}. For this method, a sharp companion kernel decomposes the velocity into a positive scalar preconditioning of a sharp-score mismatch plus a Laplace scale-mismatch residual, producing an analogous finite-particle rate with an unavoidable residual term. Finally, we explain how the continuous-time residual-velocity bounds translate into one-step generation guarantees through the explicit drift size ηη.


Source: arXiv:2605.22795v1 - http://arxiv.org/abs/2605.22795v1 PDF: https://arxiv.org/pdf/2605.22795v1 Original Link: http://arxiv.org/abs/2605.22795v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
May 22, 2026
Topic:
Artificial Intelligence
Area:
AI
Comments:
0
Bookmark