An Adaptive Metropolis Algorithm
Heikki Haario, Eero Saksman, Johanna Tamminen · Bernoulli · 2001
A proper choice of a proposal distribution for MCMC methods, e.g. for the Metropolis-Hastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis Algorithm (AM), where the Gaussian proposal distribution is updated along the process using the full information cumulated so far. Due to the adaptive nature of the process, the AM algorithm is non-Markovian, but we establish here that it has the correct ergodic properties. We also include the results of our numerical tests, which indicate that the AM algorithm competes well with traditional MetropolisHastings algorithms, and demonstrate that AM provides an easy to use algorithm for practical computation. 1991 Mathematics Subject Classification: 65C05, 65U05. Keywords: adaptive MCMC, comparison, convergence, ergodicity, Markov Chain Monte Carlo, Metropolis-Hastings algorithm 1 Introduction It is generally acknowledged that the choice of an effective proposal...
Cited by 2,631 works. doi:10.2307/3318737
Authors
References
- Monte Carlo sampling methods using Markov chains and their applications
- Markov Chains for Exploring Posterior Distributions
- Mathematical Foundations of the Calculus of Probability.
- Martingale Limit Theory and its Application.
- Introduction to Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) Equations of State Calculations by Fast Computing Machines. J. Chem. Phys.,21, 1087–1092. and Geman and Geman (1984) Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. Pattern Anal. Machine Intelligence,6, 721–741.
- Monte Carlo: Concepts, Algorithms, and Applications
- Martingale Limit Theory and its Application
- General Irreducible Markov Chains and Non-Negative Operators.
- A Maximal Inequality and Dependent Strong Laws
- Weak convergence and optimal scaling of random walk Metropolis algorithms