English

Training-Free Generative Sampling via Moment-Matched Score Smoothing

Machine Learning 2026-05-15 v1 Machine Learning

Abstract

Diffusion models generate samples by denoising along the score of a perturbed target distribution. In practice, one trains a neural diffusion model, which is computationally expensive. Recent work suggests that score matching implicitly smooths the empirical score, and that this smoothing bias promotes generalization by capturing low-dimensional data geometry. We propose moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD), a training-free interacting particle sampler that enforces the target moments throughout the sampling trajectory. We prove that, in the large-particle limit, the empirical particle density converges to a deterministic limit whose one-particle stationary marginal is a Gibbs--Boltzmann density obtained by exponentially tilting a naive score-smoothed diffusion target. The mean and covariance of this distribution agree with the empirical moments of the training data. Experiments on 2D distributions and latent-space image generation show that MM-SOLD enables fast, robust, training-free sampling on CPUs, with sample fidelity and diversity competitive with neural diffusion baselines.

Keywords

Cite

@article{arxiv.2605.14276,
  title  = {Training-Free Generative Sampling via Moment-Matched Score Smoothing},
  author = {Zhenyu Yao and Daniel Paulin},
  journal= {arXiv preprint arXiv:2605.14276},
  year   = {2026}
}

Comments

35 pages

R2 v1 2026-07-22T07:11:26.563Z