The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
On the ergodicity properties of some adaptive MCMC algorithms
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Inference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
Martingale Limit Theory and its Application.
Loynes, R. M., Hall, P., & Heyde, C. C. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981599 · Cited by 2,685
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Martingale Limit Theory and its Application
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10818-5 · Cited by 1,912
Markov Chains and Stochastic Stability
Meyn, S., Tweedie, R. L., & Glynn, P. W. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626630 · Cited by 1,680
Stochastic Approximation Algorithms and Applications
Puhalskii, A., Kushner, H. J., & Yin, G. G. (1998) · Journal of the American Statistical Association · doi:10.2307/2669885 · Cited by 994
Stochastic Approximation Algorithms and Applications
Kushner, H. J., & Yin, G. G. (1997) · Springer eBooks · doi:10.1007/978-1-4899-2696-8 · Cited by 869
The EM Algorithm—an Old Folk-song Sung to a Fast New Tune
Meng, X.-L., & Van Dyk, D. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00082 · Cited by 802
Efficient Metropolis Jumping Rules
Gelman*, A., Roberts**, G. O., & Gilks***, W. R. (1996) · Bayesian Statistics 5 · doi:10.1093/oso/9780198523567.003.0038 · Cited by 796
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
A Maximal Inequality and Dependent Strong Laws
McLeish, D. L. (1975) · The Annals of Probability · doi:10.1214/aop/1176996269 · Cited by 423
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
On adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Adaptive Markov Chain Monte Carlo through Regeneration
Gilks, W. R., Roberts, G. O., & Sahu, S. K. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473766 · Cited by 297
Geometric ergodicity of Metropolis algorithms
Jarner, S. F., & Hansen, E. (2000) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(99)00082-4 · Cited by 218
Asymptotic Normality of Sums of Dependent Random Variables
Dvoretzky, A. (1972) · Probability Theory · doi:10.1525/9780520423671-032 · Cited by 215
Finite Mixture Distributions, Sequential Likelihood and the EM Algorithm
Arcidiacono, P., & Jones, J. B. (2003) · Econometrica · doi:10.1111/1468-0262.00431 · Cited by 197
Stability of Stochastic Approximation under Verifiable Conditions
Andrieu, C., Moulines, É., & Priouret, P. (2005) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012902417267 · Cited by 194
Self-citationRenewal theory and computable convergence rates for geometrically ergodic Markov chains
Baxendale, P. H. (2005) · The Annals of Applied Probability · doi:10.1214/105051604000000710 · Cited by 181
Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
Chen, H.-F., Guo, L., & Gao, A. (1987) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(87)90039-1 · Cited by 107
Controlled MCMC for Optimal SamplingPreprint
Andrieu, C., & Robert, C. P. (2001) · RePEc: Research Papers in Economics · Cited by 77
Self-citation
Cited by
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Haario, H., Laine, M., Mira, A., & Saksman, E. (2006) · Statistics and Computing · doi:10.1007/s11222-006-9438-0 · Cited by 1,498
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Self-citationCoupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
Roberts, G. O., & Rosenthal, J. S. (2007) · Journal of Applied Probability · doi:10.1239/jap/1183667414 · Cited by 362
Robust adaptive Metropolis algorithm with coerced acceptance rate
Vihola, M. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9269-5 · Cited by 258
Metadata
- Authors
- Andrieu, C., & Moulines, É.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 2006-08-01
- Volume
- 16
- Issue
- 3
- Pages
- 1462-1505
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W2064871928
- Cited by
- 277
- References
- 27
- FWCI
- 12.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.