On the stability and ergodicity of adaptive scaling Metropolis algorithms

Journal article

The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. Both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one also incorporates covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails. © 2011 Elsevier B.V. All rights reserved.

Authors: Vihola, M

• Journal: Stochastic Processes and their Applications
• Volume: 121
• Issue: 12
• Pages: 2839-2860
• Publication date: 2011-12-01
• DOI: 10.1016/j.spa.2011.08.006
• ISSN: 0304-4149
• Language: English
• Keywords: Stochastic approximation; Stability; Law of large numbers; Adaptive Markov chain Monte Carlo; Metropolis algorithm