Diffusions limits of the Random Walk Metropolis Algorithm in High Dimensions:
- đ¤ Speaker: Natesh Pillai, Warwick
- đ Date & Time: Friday 13 February 2009, 16:00 - 17:00
- đ Venue: MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
Abstract
Metropolis-Hastings methods form a widely used class of MCMC methods for sampling from complex probability distributions. Diffusion limits of MCMC methods (obtained by a invariance principle argument) in high dimensions provide a useful theoretical tool for studying efficiency. In particular they facilitate 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 only been proved for target measures with a product structure, severely limiting their applicability to real applications. In this talk, we will discuss diffusion limits for a class of naturally occuring high dimensional measures, found from the approximation of measures on a Hilbert space which are absolutely continuous with respect to a Gaussian reference measure.
Series This talk is part of the Statistics series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge talks
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- Machine Learning
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Statistics
- Statistics Group
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Natesh Pillai, Warwick
Friday 13 February 2009, 16:00-17:00