Local Geometric Mixing via Dobrushin Contraction with Applications to Diffusion Path Monte Carlo and the Proximal Sampler
Not on the map. Why?
Abstract (arXiv)
Local geometric mixing localizes geometric mixing by requiring geometric convergence to equilibrium in total variation only over finitely many transitions. It accommodates local convergence rates and captures rapid local equilibration, even when global mixing is much slower. We establish and discuss local geometric mixing bounds through Dobrushin contraction. We then apply this approach to Diffusion Path Monte Carlo, a recently proposed Markov chain Monte Carlo method, aimed at leveraging advances in score-based modeling, whose ideal transitions coincide with those of the Proximal Sampler. Our analysis covers both the ideal method and its implementable Metropolis-adjusted counterpart, providing mixing guarantees under minimal assumptions. For the ideal method, these guarantees complement recent spectral gap estimates, which we develop into mixing time bounds.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 69 references that are in the map. First posted on arXiv 23 Sep 2026.
Builds on
20 of 69 references.
References · 20
- 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 445
- 2022Convergence of denoising diffusion models under the manifold hypothesiscited by 242
- 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localizationcited by 235
- 2022Improved Analysis of Score-based Generative Modeling: User-Friendly Bounds under Minimal Smoothness Assumptionscited by 219
- 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 86
- 2022Improved analysis for a proximal algorithm for samplingcited by 73
- 2023Faster high-accuracy log-concave sampling via algorithmic warm startscited by 45
- 2023Improved dimension dependence of a proximal algorithm for samplingcited by 30
- 2021A Proximal Algorithm for Sampling from Non-smooth Potentialscited by 24
- 2022A Proximal Algorithm for Samplingcited by 22
- 2016Auxiliary gradient-based sampling algorithmscited by 21
- 2026High-accuracy sampling for diffusion models and log-concave distributionscited by 16
8 more
- 2025Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequalitycited by 12
- 2024Fast Convergence of Phi-Divergence Along the Unadjusted Langevin Algorithm and Proximal Samplercited by 11
- 2024A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplerscited by 6
- 2024Faster Sampling via Stochastic Gradient Proximal Samplercited by 5
- 2026Markov Chain Monte Carlo with Diffusion Pathscited by 5
- 2026Exact Global MCMC with Denoising Diffusioncited by 2
- 2026Alternating Diffusion for Proximal Sampling with Zeroth Order Queriescited by 1
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximationscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching
- 2023Accelerating Markov Chain Monte Carlo sampling with diffusion models
- 2023Transport meets Variational Inference: Controlled Monte Carlo Diffusions
- 2024On the Convergence and Straightness of Rectified Flow
- 2026Geometry-Aware Discretization Error of Diffusion Models
- 2023Metropolis Sampling for Constrained Diffusion Models
- 2026Flow Sampling: Learning to Sample from Unnormalized Densities via Denoising Conditional Processes
- 2025Functional Adjoint Sampler: Scalable Sampling on Infinite Dimensional Spaces