mlsanityData to 7 Oct 2026

Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension

arXiv 2108.00682 ↗First posted 2 Aug 2021math.PR cs.NA math.NAcited by 11

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

  1. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  2. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  3. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
  4. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  5. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  6. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  7. 2020Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithmcited by 57
  8. 2019Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradientscited by 51
  9. 2018Coupling and Convergence for Hamiltonian Monte Carlocited by 36
  10. 2018Non-asymptotic bounds for sampling algorithms without log-concavitycited by 35
  11. 2017The Tamed Unadjusted Langevin Algorithmcited by 31
  12. 2017Geometric integrators and the Hamiltonian Monte Carlo methodcited by 25
5 more
  1. 2020Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlocited by 22
  2. 2021Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributionscited by 19
  3. 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlocited by 18
  4. 2017Uncertainty quantification for radio interferometric imaging: I. proximal MCMC methodscited by 13
  5. 2017Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributionscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 2; 2025: 3; 2026: 1.

11 papers.