Mixing Rates for Hamiltonian Monte Carlo Algorithms in Finite and Infinite Dimensions

03/17/2020
by   Nathan E. Glatt-Holtz, et al.
0

We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be used as a basis to sample from certain classes of target measures which are absolutely continuous with respect to a Gaussian measure. Our work addresses an open question posed in [Beskos et al., Stochastic Process. Appl., 2011], and provides an alternative to a recent proof based on exact coupling techniques given in arXiv:1909.07962. The approach here establishes convergence in a suitable Wasserstein distance by using the weak Harris theorem together with a generalized coupling argument. We also show that a law of large numbers and central limit theorem can be derived as a consequence of our main convergence result. Moreover, our approach yields a novel proof of mixing rates for the classical finite-dimensional HMC algorithm. As such, the methodology we develop provides a flexible framework to tackle the rigorous convergence of other Markov Chain Monte Carlo algorithms. Additionally, we show that the scope of our result includes certain measures that arise in the Bayesian approach to inverse PDE problems, cf. [Stuart, Acta Numer., 2010]. Particularly, we verify all of the required assumptions for a certain class of inverse problems involving the recovery of a divergence free vector field from a passive scalar, arXiv:1808.01084v3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2020

Convergence of Preconditioned Hamiltonian Monte Carlo on Hilbert Spaces

In this article, we consider the preconditioned Hamiltonian Monte Carlo ...
research
06/15/2023

Second order quantitative bounds for unadjusted generalized Hamiltonian Monte Carlo

This paper provides a convergence analysis for generalized Hamiltonian M...
research
05/01/2018

Coupling and Convergence for Hamiltonian Monte Carlo

Based on a new coupling approach, we prove that the transition step of t...
research
09/13/2015

A Markov Jump Process for More Efficient Hamiltonian Monte Carlo

In most sampling algorithms, including Hamiltonian Monte Carlo, transiti...
research
08/26/2018

Hypocoercivity of Piecewise Deterministic Markov Process-Monte Carlo

In this work, we establish L^2-exponential convergence for a broad class...
research
09/18/2020

Low-rank MDP Approximation via Moment Coupling

We propose a novel method—based on local moment matching—to approximate ...
research
03/12/2021

Hamiltonian Monte Carlo in Inverse Problems; Ill-Conditioning and Multi-Modality

The Hamiltonian Monte Carlo (HMC) method allows sampling from continuous...

Please sign up or login with your details

Forgot password? Click here to reset