Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms

Abstract

Summary: The paper considers high dimensional Metropolis and Langevin algorithms in their initial transient phase. In stationarity, these algorithms are well understood and it is now well known how to scale their proposal distribution variances. For the random-walk Metropolis algorithm, convergence during the transient phase is extremely regular—to the extent that the algo-rithm's sample path actually resembles a deterministic trajectory. In contrast, the Langevin algorithm with variance scaled to be optimal for stationarity performs rather erratically. We give weak convergence results which explain both of these types of behaviour and practical guidance on implementation based on our theory.

Funding Information

Natural Sciences and Engineering Research Council of Canada

This publication has 18 references indexed in Scilit:

Bayesian Prediction of Spatial Count Data Using Generalized Linear Mixed Models
Biometrics, 2002
Optimal scaling for various Metropolis-Hastings algorithms
Statistical Science, 2001
From metropolis to diffusions: Gibbs states and optimal scaling
Stochastic Processes and their Applications, 2000
10.1007/978-1-4899-4485-6
Crossref Listing of Deleted Dois, 2000
Log Gaussian Cox Processes
Scandinavian Journal of Statistics, 1998
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Journal of the Royal Statistical Society Series B: Statistical Methodology, 1998
Optimal metropolis algorithms for product measures on the vertices of a hypercube
Stochastics and Stochastic Reports, 1998
Weak convergence and optimal scaling of random walk Metropolis algorithms
The Annals of Applied Probability, 1997
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Bernoulli, 1996
Monte Carlo sampling methods using Markov chains and their applications
Biometrika, 1970