4.4 Article

DIFFUSION LIMITS OF THE RANDOM WALK METROPOLIS ALGORITHM IN HIGH DIMENSIONS

Journal

ANNALS OF APPLIED PROBABILITY
Volume 22, Issue 3, Pages 881-930

Publisher

INST MATHEMATICAL STATISTICS
DOI: 10.1214/10-AAP754

Keywords

Markov chain Monte Carlo; scaling limits; optimal convergence time; stochastic PDEs

Funding

  1. NSF [DMS-04-49910, DMS-08-54879]
  2. EPSRC
  3. ERC
  4. Engineering and Physical Sciences Research Council [EP/F050798/1] Funding Source: researchfish
  5. Direct For Mathematical & Physical Scien
  6. Division Of Mathematical Sciences [1107070] Funding Source: National Science Foundation
  7. Division Of Mathematical Sciences
  8. Direct For Mathematical & Physical Scien [0854879] Funding Source: National Science Foundation
  9. EPSRC [EP/F050798/1] Funding Source: UKRI

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available