Gradient-Free Sampling from Generative Models via Stochastic Bounded Extremum Seeking
On the map: Diffusion models → Diffusion foundations and sampling
Abstract (arXiv)
We introduce a sampling approach for energy- and score-based generative models that requires no gradient evaluations of the model. Replacing the drift term that would normally contain the score nablax log pθ(bfx) with a high-frequency dithered cosine of the model's textitvalue, √αω,cos(ω t + k log pθ(bfx)), produces, in the high-frequency averaging limit, Langevin Markov chain Monte Carlo for energy-based models and the reverse-time SDE of score-based diffusion. We prove that trajectories of the dithered Ito SDE converge to those of the target SDE, driven by the same Brownian motion, uniformly on compact time intervals in probability, by an averaging argument that extends bounded extremum seeking (ES) to Ito processes, with an explicit O(ω-1/2) mean-square rate under global bounds. The approach is not confined to smooth targets: it extends to C1,1 energies with discontinuous curvature (without ellipticity requirement) and to Sobolev energies whose Hessians exist only off measure zero sets; for Lipschitz energies with gradient kinks the averaged limit remains well posed; the Krylov-R"ockner integrability class is the boundary of provability. The approach provides a hard textita priori bound on the per-step update rate and applies to explicitly time-varying targets on finite horizons. Gradient-free pixel-space sampling is not competitive with well-tuned backpropagation-based samplers at practical evaluation budgets; the regime where the approach offers an advantage is latent-space sampling when the model is a black box and the target drifts in time. We demonstrate latent-space tracking for time-varying images on CelebA-HQ (256×256) from limited 1D projection measurements and latent-space EBM sampling on CIFAR-10.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. First posted on arXiv 3 Oct 2026.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions
- 2023On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates
- 2023Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
- 2021Score-Based Generative Modeling with Critically-Damped Langevin Diffusion
- 2022An optimal control perspective on diffusion-based generative modeling
- 2025Information-Theoretic Proofs for Diffusion Sampling
- 2026Training-Free Generative Sampling via Moment-Matched Score Smoothing
- 2025Convergence of Deterministic and Stochastic Diffusion-Model Samplers: A Simple Analysis in Wasserstein Distance