The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On adaptive Markov chain Monte Carlo algorithms
Open accessAbstract
We look at adaptive Markov chain Monte Carlo algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the history of the process. We show under certain conditions that the stochastic process generated is ergodic, with appropriate stationary distribution. We use this result to analyse an adaptive version of the random walk Metropolis algorithm where the scale parameter σ is sequentially adapted using a Robbins-Monro type algorithm in order to find the optimal scale parameter σopt. We close with a simulation example.
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
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Doob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
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
Stochastic Approximation and Recursive Algorithms and Applications
(2003) · Stochastic Modelling and Applied Probability · doi:10.1007/b97441 · Cited by 1,838
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
Optimal 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-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
Cited by
Haario, H., Laine, M., Mira, A., & Saksman, E. (2006) · Statistics and Computing · doi:10.1007/s11222-006-9438-0 · Cited by 1,498
Roberts, G. O., & Rosenthal, J. S. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.06134 · Cited by 1,028
Self-citationAndrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
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
Self-citation
Metadata
- Authors
- Atchadé, Y. F., & Rosenthal, J. S.
- Venue
- Bernoulli
- Published
- 2005-10-01
- Volume
- 11
- Issue
- 5
- Pages
- 815-828
- ISSN
- 1350-7265 (ISSN-L)
- OpenAlex
- W1979641008
- Cited by
- 353
- References
- 13
- FWCI
- 12.17
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On adaptive Markov chain Monte Carlo algorithms. https://app.cochat.ai/papers/10.3150/bj/1130077595
- The paper
- Atchadé, Y. F., & Rosenthal, J. S. (2005). On adaptive Markov chain Monte Carlo algorithms. Bernoulli. https://doi.org/10.3150/bj/1130077595
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.