Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
Martin Hairer, Andrew M. Stuart, Sebastian J. Vollmer

TL;DR
This paper proves that the pCN Metropolis-Hastings algorithm maintains a dimension-independent spectral gap and convergence properties in infinite-dimensional spaces, unlike the RWM method, which deteriorates with increasing dimension.
Contribution
It establishes a dimension-independent Wasserstein spectral gap for pCN in infinite dimensions, confirming its superior scalability over RWM.
Findings
pCN has a dimension-independent spectral gap
ergodic averages satisfy CLT and LLN independently of dimension
RWM spectral gap degenerates as dimension increases
Abstract
We study the problem of sampling high and infinite dimensional target measures arising in applications such as conditioned diffusions and inverse problems. We focus on those that arise from approximating measures on Hilbert spaces defined via a density with respect to a Gaussian reference measure. We consider the Metropolis-Hastings algorithm that adds an accept-reject mechanism to a Markov chain proposal in order to make the chain reversible with respect to the target measure. We focus on cases where the proposal is either a Gaussian random walk (RWM) with covariance equal to that of the reference measure or an Ornstein-Uhlenbeck proposal (pCN) for which the reference measure is invariant. Previous results in terms of scaling and diffusion limits suggested that the pCN has a convergence rate that is independent of the dimension while the RWM method has undesirable dimension-dependent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
