Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension
Not on the map. Why?
Abstract (arXiv)
Inexact Markov Chain Monte Carlo methods rely on Markov chains that do not exactly preserve the target distribution. Examples include the unadjusted Langevin algorithm (ULA) and unadjusted Hamiltonian Monte Carlo (uHMC). This paper establishes bounds on Wasserstein distances between the invariant probability measures of inexact MCMC methods and their target distributions with a focus on understanding the precise dependence of this asymptotic bias on both dimension and discretization step size. Assuming Wasserstein bounds on the convergence to equilibrium of either the exact or the approximate dynamics, we show that for both ULA and uHMC, the asymptotic bias depends on key quantities related to the target distribution or the stationary probability measure of the scheme. As a corollary, we conclude that for models with a limited amount of interactions such as mean-field models, finite range graphical models, and perturbations thereof, the asymptotic bias has a similar dependence on the step size and the dimension as for product measures.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 17 of its 66 references that are in the map. First posted on arXiv 2 Aug 2021.
Builds on
17 of 66 references.
References · 17
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
- 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
- 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
- 2020Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithmcited by 57
- 2019Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradientscited by 51
- 2018Coupling and Convergence for Hamiltonian Monte Carlocited by 36
- 2018Non-asymptotic bounds for sampling algorithms without log-concavitycited by 35
- 2017The Tamed Unadjusted Langevin Algorithmcited by 31
- 2017Geometric integrators and the Hamiltonian Monte Carlo methodcited by 25
5 more
- 2020Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlocited by 22
- 2021Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributionscited by 19
- 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlocited by 18
- 2017Uncertainty quantification for radio interferometric imaging: I. proximal MCMC methodscited by 13
- 2017Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributionscited by 12
Built on by
Citing papers per year: 2022: 1; 2023: 4; 2024: 2; 2025: 3; 2026: 1.
11 papers.
- 2025Microcanonical Langevin Ensembles: Advancing the Sampling of Bayesian Neural Networkscited by 10
- 2022Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integrationcited by 8
- 2023Rosenthal-type inequalities for linear statistics of Markov chainscited by 5
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithmscited by 4
- 2024Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Biascited by 4
- 2023Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient casecited by 3
- 2024Mixing of the No-U-Turn Sampler and the Geometry of Gaussian Concentrationcited by 3
- 2025Random Reshuffling for Stochastic Gradient Langevin Dynamicscited by 2
- 2023Randomized Runge-Kutta-Nystr"om Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlocited by 1
- 2026Wasserstein mixing time of the unadjusted Langevin algorithmcited by 1
- 2025A hierarchical entropy method for the delocalization of bias in high-dimensional Langevin Monte Carlocited by 0
- 2026Wasserstein mixing time of the unadjusted Langevin algorithm3 Aug 2026
- 2025A hierarchical entropy method for the delocalization of bias in high-dimensional Langevin Monte Carlo10 Sep 2025
- 2025Microcanonical Langevin Ensembles: Advancing the Sampling of Bayesian Neural Networks10 Feb 2025
- 2025Random Reshuffling for Stochastic Gradient Langevin Dynamics27 Jan 2025
- 2024Mixing of the No-U-Turn Sampler and the Geometry of Gaussian Concentration9 Oct 2024
- 2024Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Bias20 Aug 2024
- 2023Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case28 Oct 2023
- 2023Randomized Runge-Kutta-Nystr"om Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlo11 Oct 2023
- 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms25 May 2023
- 2023Rosenthal-type inequalities for linear statistics of Markov chains10 Mar 2023
- 2022Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integration20 Nov 2022