Alternating Diffusion for Proximal Sampling with Zeroth Order Queries
Not on the map. Why?
Abstract (arXiv)
This work introduces a new approximate proximal sampler that operates solely with zeroth-order information of the potential function. Prior theoretical analyses have revealed that proximal sampling corresponds to alternating forward and backward iterations of the heat flow. The backward step was originally implemented by rejection sampling, whereas we directly simulate the dynamics. Unlike diffusion-based sampling methods that estimate scores via learned models or by invoking auxiliary samplers, our method treats the intermediate particle distribution as a Gaussian mixture, thereby yielding a Monte Carlo score estimator from directly samplable distributions. Theoretically, when the score estimation error is sufficiently controlled, our method inherits the exponential convergence of proximal sampling under isoperimetric conditions on the target distribution. In practice, the algorithm avoids rejection sampling, permits flexible step sizes, and runs with a deterministic runtime budget. Numerical experiments demonstrate that our approach converges rapidly to the target distribution, driven by interactions among multiple particles and by exploiting parallel computation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 43 references that are in the map. First posted on arXiv 20 Mar 2026.
Builds on
33 of 43 references.
References · 33
- 2022DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Stepscited by 1,979
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
- 2023Denoising Diffusion Samplerscited by 149
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 118
- 2023Improved sampling via learned diffusionscited by 104
- 2017Convergence of Langevin MCMC in KL-divergencecited by 88
- 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 86
- 2024Accelerating Convergence of Score-Based Diffusion Models, Provablycited by 76
- 2022Improved analysis for a proximal algorithm for samplingcited by 73
- 2023On the Generalization Properties of Diffusion Modelscited by 68
21 more
- 2015Sampling from a log-concave distribution with Projected Langevin Monte Carlocited by 52
- 2022Probability flow solution of the Fokker-Planck equationcited by 47
- 2017Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlocited by 43
- 2023Reverse Diffusion Monte Carlocited by 41
- 2023Improved dimension dependence of a proximal algorithm for samplingcited by 30
- 2024Stochastic Localization via Iterative Posterior Samplingcited by 28
- 2021A Proximal Algorithm for Sampling from Non-smooth Potentialscited by 24
- 2024Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Samplingcited by 23
- 2022A Proximal Algorithm for Samplingcited by 22
- 2024Diffusive Gibbs Samplingcited by 21
- 2024Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusioncited by 19
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodiescited by 19
- 2024Diffusion models for Gaussian distributions: Exact solutions and Wasserstein errorscited by 16
- 2024Faster Sampling without Isoperimetry via Diffusion-based Monte Carlocited by 15
- 2023Score-based Transport Modeling for Mean-Field Fokker-Planck Equationscited by 14
- 2022Denoising MCMC for Accelerating Diffusion-Based Generative Modelscited by 13
- 2022Penalized Overdamped and Underdamped Langevin Monte Carlo Algorithms for Constrained Samplingcited by 13
- 2024Path-Guided Particle-based Samplingcited by 8
- 2024Proximal Oracles for Optimization and Samplingcited by 6
- 2025Score-based deterministic density samplingcited by 4
- 2025Oracle-based Uniform Sampling from Convex Bodiescited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.