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.
Additional Information
© Institute of Mathematical Statistics, 2012. Received March 2010; revised November 2010. [JCM] Supported by NSF Grants DMS-04-49910 and DMS-08-54879. [AMS] Supported by EPSRC and ERC.Attached Files
Published - stuart93.pdf
Submitted - 1003.4306.pdf
Files
Name | Size | Download all |
---|---|---|
md5:b8cb789f8fa4705e47a6efcd4cd7d58a
|
497.3 kB | Preview Download |
md5:abd09408ca96923454928861bccd496f
|
584.8 kB | Preview Download |
Additional details
- Eprint ID
- 69294
- Resolver ID
- CaltechAUTHORS:20160728-154635836
- NSF
- DMS-04-49910
- NSF
- DMS-08-54879
- Engineering and Physical Sciences Research Council (EPSRC)
- European Research Council (ERC)
- Created
-
2016-08-01Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field
- Other Numbering System Name
- Andrew Stuart
- Other Numbering System Identifier
- J93