ASYMPTOTIC BIAS OF INEXACT MARKOV CHAIN MONTE CARLO METHODS IN HIGH DIMENSION

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)3435-3468
Number of pages34
JournalAnnals of Applied Probability
Volume34
Issue number4
DOIs
Publication statusPublished - 1 Aug 2024

Keywords

  • Coupling
  • Hamiltonian Monte Carlo
  • Markov chain Monte Carlo
  • convergence to equilibrium
  • hybrid Monte Carlo

Fingerprint

Dive into the research topics of 'ASYMPTOTIC BIAS OF INEXACT MARKOV CHAIN MONTE CARLO METHODS IN HIGH DIMENSION'. Together they form a unique fingerprint.

Cite this