Home > Research > Publications & Outputs > Optimal scaling of random walk Metropolis algor...
View graph of relations

Optimal scaling of random walk Metropolis algorithms with discontinuous target densities

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2012
<mark>Journal</mark>Annals of Applied Probability
Issue number5
Number of pages48
Pages (from-to)1880-1927
Publication StatusPublished
<mark>Original language</mark>English


We consider the optimal scaling problem for high-dimensional random walk Metropolis (RWM) algorithms where the target distribution has a discontinuous probability density function. Almost all previous analysis has focused upon continuous target densities. The main result is a weak convergence result as the dimensionality d of the target densities converges to ∞. In particular, when the proposal variance is scaled by d−2, the sequence of stochastic processes formed by the first component of each Markov chain converges to an appropriate Langevin diffusion process. Therefore optimizing the efficiency of the RWM algorithm is equivalent to maximizing the speed of the limiting diffusion. This leads to an asymptotic optimal acceptance rate of e−2 (=0.1353) under quite general conditions. The results have major practical implications for the implementation of RWM algorithms by highlighting the detrimental effect of choosing RWM algorithms over Metropolis-within-Gibbs algorithms.