On the ergodicity properties of some adaptive MCMC algorithms
Top Cited Papers
Open Access
- 1 August 2006
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 16 (3) , 1462-1505
- https://doi.org/10.1214/105051606000000286
Abstract
In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a so-called adaptive MCMC sampler converge to the required value and can even, under more stringent assumptions, satisfy a central limit theorem. We prove that the conditions required are satisfied for the independent Metropolis–Hastings algorithm and the random walk Metropolis algorithm with symmetric increments. Finally, we propose an application of these results to the case where the proposal distribution of the Metropolis–Hastings update is a mixture of distributions from a curved exponential family.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- On the ergodicity properties of some adaptive MCMC algorithmsThe Annals of Applied Probability, 2006
- Renewal theory and computable convergence rates for geometrically ergodic Markov chainsThe Annals of Applied Probability, 2005
- Finite Mixture Distributions, Sequential Likelihood and the EM AlgorithmEconometrica, 2003
- On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distributionScandinavian Journal of Statistics, 2003
- A Liapounov bound for solutions of the Poisson equationThe Annals of Probability, 1996
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithmsBiometrika, 1996
- Computable Bounds for Geometric Convergence Rates of Markov ChainsThe Annals of Applied Probability, 1994
- Inference from Iterative Simulation Using Multiple SequencesStatistical Science, 1992
- On the Convergence Properties of the EM AlgorithmThe Annals of Statistics, 1983
- Some Multivariate Chebyshev Inequalities with Extensions to Continuous Parameter ProcessesThe Annals of Mathematical Statistics, 1961