The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
Abstract
We consider basic ergodicity properties of adaptive Markov chain Monte Carlo algorithms under minimal assumptions, using coupling constructions. We prove convergence in distribution and a weak law of large numbers. We also give counterexamples to demonstrate that the assumptions we make are not redundant.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Weak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693 · cited 1×
“(Such a proposal is optimal in certain settings according to the results of Roberts et al. (1997); see also Roberts and Rosenthal (2001) and Bédard (2006).)”
BackgroundSelf-citationOptimal scaling for various Metropolis-Hastings algorithms
Roberts, G. O., & Rosenthal, J. S. (2001) · Statistical Science · doi:10.1214/ss/1015346320 · Cited by 1,103
Self-citationGeneral state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Self-citationMinorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Rosenthal, J. S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476548 · Cited by 487
Self-citationOn adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Self-citationAdaptive 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
Self-citationOn the ergodicity properties of some adaptive MCMC algorithms
Andrieu, C., & Moulines, É. (2006) · The Annals of Applied Probability · doi:10.1214/105051606000000286 · Cited by 277
Renewal 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
Adaptively Scaling the Metropolis Algorithm Using Expected Squared Jumped DistancePreprint
Gelman, A., & Pasarica, C. (2007) · SSRN Electronic Journal · doi:10.2139/ssrn.1010403 · Cited by 80
Identification of Regeneration Times in MCMC Simulation, With Application to Adaptive Schemes
Brockwell, A., & Kadane, J. B. (2005) · Journal of Computational and Graphical Statistics · doi:10.1198/106186005x47453 · Cited by 79
Controlled MCMC for Optimal SamplingPreprint
Andrieu, C., & Robert, C. P. (2001) · RePEc: Research Papers in Economics · Cited by 77
Convergence Properties of Perturbed Markov Chains
Roberts, G. O., Rosenthal, J. S., & Schwartz, P. O. (1998) · Journal of Applied Probability · doi:10.1239/jap/1032192546 · Cited by 63
Self-citationFaithful Couplings of Markov Chains: Now Equals Forever
Rosenthal, J. S. (1997) · Advances in Applied Mathematics · doi:10.1006/aama.1996.0515 · Cited by 37
Self-citationKing, R., Morgan, B., Giménez, O., & Brooks, S. (2009) · Chapman & Hall/CRC eBooks · doi:10.1201/9781439811887-12 · Cited by 6
Cited by
Particle Markov Chain Monte Carlo Methods
Andrieu, C., Doucet, A., & Holenstein, R. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00736.x · Cited by 1,971
Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
Peherstorfer, B., Willcox, K., & Gunzburger, M. (2018) · SIAM Review · doi:10.1137/16m1082469 · Cited by 1,061
Veitch, J., Raymond, V., Farr, B., Farr, W., Graff, P., Vitale, S., Aylott, B., Blackburn, K., Christensen, N., Coughlin, M., et al. (2015) · Physical Review D · doi:10.1103/physrevd.91.042003 · Cited by 958
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Vrugt, J. A. (2016) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2015.08.013 · Cited by 851
Metadata
- Authors
- Roberts, G. O., & Rosenthal, J. S.
- Venue
- Journal of Applied Probability
- Publisher
- Cambridge University Press (CUP)
- Published
- 2007-06
- Volume
- 44
- Issue
- 2
- Pages
- 458-475
- ISSN
- 0021-9002 (ISSN-L)
- 1475-6072
- OpenAlex
- W2006582998
- Cited by
- 362
- References
- 18
- FWCI
- 12.61
- Type
- journal article
- Language
- en
- Open access
- closed
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.