Diffusion limits of the random walk Metropolis algorithm in high dimensions
Abstract
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to date such results have mainly been proved for target measures with a product structure, severely limiting their applicability. The purpose of this paper is to study diffusion limits for a class of naturally occurring high-dimensional measures found from the approximation of measures on a Hilbert space which are absolutely continuous with respect to a Gaussian reference measure. The diffusion limit of a random walk Metropolis algorithm to an infinite-dimensional Hilbert space valued SDE (or SPDE) is proved, facilitating understanding of the computational complexity of the algorithm.
Cite
@article{arxiv.1003.4306,
title = {Diffusion limits of the random walk Metropolis algorithm in high dimensions},
author = {Jonathan C. Mattingly and Natesh S. Pillai and Andrew M. Stuart},
journal= {arXiv preprint arXiv:1003.4306},
year = {2012}
}
Comments
Published in at http://dx.doi.org/10.1214/10-AAP754 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)