Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets

Abstract

Scaling of proposals for Metropolis algorithms is an important practical problem in MCMC implementation. Criteria for scaling based on empirical acceptance rates of algorithms have been found to work consistently well across a broad range of problems. Essentially, proposal jump sizes are increased when acceptance rates are high and decreased when rates are low. In recent years, considerable theoretical support has been given for rules of this type which work on the basis that acceptance rates around 0.234 should be preferred. This has been based on asymptotic results that approximate high dimensional algorithm trajectories by diffusions. In this paper, we develop a novel approach to understanding 0.234 which avoids the need for diffusion limits. We derive explicit formulae for algorithm efficiency and acceptance rates as functions of the scaling parameter. We apply these to the family of elliptically symmetric target densities, where further illuminating explicit results are possible. Under suitable conditions, we verify the 0.234 rule for a new class of target densities. Moreover, we can characterise cases where 0.234 fails to hold, either because the target density is too diffuse in a sense we make precise, or because the eccentricity of the target density is too severe, again in a sense we make precise. We provide numerical verifications of our results.

arXiv commentPublished in at http://dx.doi.org/10.3150/08-BEJ176 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)

References in corpus (1)

• Weak convergence of Metropolis algorithms for non-i.i.d. target distributions

Cited by in corpus (19)

• On the efficiency of pseudo-marginal random walk Metropolis algorithms
• Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions
• The Random Walk Metropolis: Linking Theory and Practice Through a Case Study
• On the stability and ergodicity of adaptive scaling Metropolis algorithms
• Spherical Hamiltonian Monte Carlo for Constrained Target Distributions
• Information-geometric Markov Chain Monte Carlo methods using Diffusions
• Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
• A Semiparametric Bayesian Model for Detecting Synchrony Among Multiple Neurons
• Complexity Bounds for MCMC via Diffusion Limits
• Sampling Constrained Continuous Probability Distributions: A Review
• Optimal Scaling of Random-Walk Metropolis Algorithms on General Target Distributions
• An Adaptive Sequential Monte Carlo Sampler
• Predicting Feynman periods in ${\varphi }^4$-theory
• Rate optimality of Random walk Metropolis algorithm in high-dimension with heavy-tailed target distribution
• Optimal scaling of the Random Walk Metropolis algorithm under Lp mean differentiability
• Analysis of the Gibbs sampler for hierarchical inverse problems
• Optimal scaling of the independence sampler: Theory and Practice
• Simultaneous estimation of complementary moment independent sensitivity measures for reliability analysis
• Scalable couplings for the random walk Metropolis algorithm