A tutorial on adaptive MCMC
Open accessThe DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
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
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Monte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
Probabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Monte Carlo Statistical Methods
Robert, C. P., & Casella, G. (1999) · Springer Texts in Statistics · doi:10.1007/978-1-4757-3071-5 · Cited by 2,278
Stochastic Volatility: Likelihood Inference and Comparison with ARCH Models
Kim, S., Shepherd, N., & Chib, S. (1998) · Review of Economic Studies · doi:10.1111/1467-937x.00050 · Cited by 2,261
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
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 5×
“Even though the possibility of using an EM-algorithm is mentioned, it is Roweis (1997) who extends the formalism more specifically to the application of such a scheme. The approach suffers however from a rotational ambiguity in the latent variable space, since the returned vector set is a linear superposition of the p…”
BackgroundMethodInfluentialHaario, 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
EM Algorithms for PCA and SPCA
Roweis, S. T. (1997) · neural information processing systems · Cited by 1,018
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Robert, C. P., & Casella, G. (2005) · Springer eBooks · Cited by 1,002
Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
Geyer, C. J., & Thompson, E. A. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476590 · Cited by 910
Monte Carlo simulation of a many-fermion study
Ceperley, D., Chester, G. V., & Kalos, M. H. (1977) · Physical Review B · doi:10.1103/physrevb.16.3081 · Cited by 777
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Spatial Statistics and Bayesian Computation
Besag, J., & Green, P. J. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01467.x · Cited by 542
Accelerated Stochastic Approximation
Kesten, H. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706705 · Cited by 433
Adaptive stochastic approximation by the simultaneous perturbation method
Spall, J. C. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2000.880982 · Cited by 424
Adaptive proposal distribution for random walk Metropolis algorithm
Haario, H., Saksman, E., & Tamminen, J. (1999) · Computational Statistics · doi:10.1007/s001800050022 · Cited by 417
Image Analysis, Random Fields and Markov Chain Monte Carlo Methods
Winkler, G. (2003) · Springer eBooks · doi:10.1007/978-3-642-55760-6 · Cited by 397
Coupling 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
The Multiple-Try Method and Local Optimization in Metropolis Sampling
Liu, J. S., Liang, F., & Wong, W. H. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10473908 · Cited by 360
Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Boutilier, C. E., & Goldszmidt, M. (2000) · Cited by 359
On adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Highly Structured Stochastic Systems
Green, P. J. (2003) · CERN Document Server (European Organization for Nuclear Research) · Cited by 332
Trans-dimensional Markov chain Monte Carlo
Green, P. J. (2003) · Highly Structured Stochastic Systems · doi:10.1093/oso/9780198510550.003.0017 · Cited by 329
Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
Brooks, S. P., Giudici, P., & Roberts, G. O. (2003) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.03711 · Cited by 310
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
Some adaptive Monte Carlo methods for Bayesian inference
Tierney, L., & Mira, A. (1999) · Statistics in Medicine · doi:10.1002/(sici)1097-0258(19990915/30)18:17/18<2507::aid-sim272>3.0.co;2-j · Cited by 293
On the ergodicity properties of some adaptive MCMC algorithms
Andrieu, C., & Moulines, É. (2006) · The Annals of Applied Probability · doi:10.1214/105051606000000286 · Cited by 277
Self-citationDelayed rejection in reversible jump Metropolis-Hastings
Green, P. J., & Mira, A. (2001) · Biometrika · doi:10.1093/biomet/88.4.1035 · Cited by 263
Regeneration in Markov Chain Samplers
Mykland, P., Tierney, L., & Yu, B. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476507 · Cited by 224
Componentwise adaptation for high dimensional MCMC
Haario, H., Saksman, E., & Tamminen, J. (2005) · Computational Statistics · doi:10.1007/bf02789703 · Cited by 221
Adaptive importance sampling in general mixture classes
Cappé, O., Douc, R., Guillin, A., Marin, J.-M., & Robert, C. P. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9059-x · Cited by 216
Adaptive Importance Sampling in General Mixture ClassesPreprint
Cappé, O., Douc, R., Guillin, A., Marin, J., & Robert, C. P. (2007) · Cited by 201
Implementation and performance issues in the Bayesian and likelihood fitting of multilevel models
Browne, W. J., & Draper, D. (2000) · Computational Statistics · doi:10.1007/s001800000041 · Cited by 199
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-citationGilks, W. R., Roberts, G. O., & George, E. I. (1994) · The Statistician · doi:10.2307/2348942 · Cited by 175
An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift
Atchadé, Y. F. (2006) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-006-8550-0 · Cited by 174
Posterior simulation and Bayes factors in panel count data models
Chib, S., Greenberg, E., & Winkelmann, R. (1998) · Journal of Econometrics · doi:10.1016/s0304-4076(97)00108-5 · Cited by 148
Winkler, G. (2006) · Springer eBooks · Cited by 131
Spatial statistics and Bayesian computation (with discussion)
Besag, J. E., & Green, P. J. (1993) · Bristol Research (University of Bristol) · Cited by 119
Adaptive sampling for Bayesian variable selection
Nott, D. J., & Kohn, R. (2005) · Biometrika · doi:10.1093/biomet/92.4.747 · Cited by 114
Computer Simulations in Condensed Matter Systems: From Materials to Chemical Biology Volume 1
Ferrario, M., Ciccotti, G., & Binder, K. (2006) · Lecture notes in physics · doi:10.1007/3-540-35273-2 · Cited by 110
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
Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
Bédard, M. (2008) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2007.12.005 · Cited by 99
Population Markov Chain Monte Carlo
Laskey, K. B., & Myers, J. W. (2003) · Machine Learning · doi:10.1023/a:1020206129842 · Cited by 98
Coupling and Ergodicity of Adaptive MCMC
Rosenthal, J. S. (2007) · Cited by 94
General results on the convergence of stochastic algorithms
Delyon, B. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.536495 · Cited by 92
Weak convergence of Metropolis algorithms for non-i.i.d. target distributions
Bédard, M. (2007) · The Annals of Applied Probability · doi:10.1214/105051607000000096 · Cited by 84
Controlled MCMC for Optimal SamplingPreprint
Andrieu, C., & Robert, C. P. (2001) · RePEc: Research Papers in Economics · Cited by 77
Self-citationLangevin-Type Models II: Self-Targeting Candidates for MCMC Algorithms*
Stramer, O., & Tweedie, R. L. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010090512027 · Cited by 73
Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
Sherlock, C., & Roberts, G. O. (2009) · Bernoulli · doi:10.3150/08-bej176 · Cited by 72
On Markov Chain Monte Carlo Acceleration
Gelfand, A. E., & Sahu, S. K. (1994) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1994.10474644 · Cited by 71
On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
Saksman, E., & Vihola, M. (2010) · The Annals of Applied Probability · doi:10.1214/10-aap682 · Cited by 66
de Freitas, N., Højen-Sørensen, P. A. D. F. R., Jordan, M. I., & Russell, S. (2001) · Uncertainty in Artificial Intelligence · Cited by 63
Accelerated Stochastic Approximation
Delyon, B., & Juditsky, A. (1993) · SIAM Journal on Optimization · doi:10.1137/0803045 · Cited by 61
Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
Atchadé, Y. F., & Fort, G. (2010) · Bernoulli · doi:10.3150/09-bej199 · Cited by 59
MCMC for nonlinear hierarchical models
Gilks, W. R., Richardson, S. T., & Spiegelhalter, D. J. (1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835-24 · Cited by 56
On the containment condition for adaptive Markov Chain Monte Carlo algorithms
Bai, Y., Roberts, G. O., & Rosenthal, J. S. (2009) · Warwick Research Archive Portal (University of Warwick) · doi:10.82444/warw.33598039 · Cited by 50
Towards Automatic Reversible Jump Markov Chain Monte Carlo
Hastie, D. I. (2005) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 32
Cited by
Flexible paleoclimate age-depth models using an autoregressive gamma process
Blaauw, M., & Christen, J. A. (2011) · Bayesian Analysis · doi:10.1214/11-ba618 · Cited by 4,502
Ensemble samplers with affine invariance
Goodman, J., & Weare, J. (2010) · Communications in Applied Mathematics and Computational Science · doi:10.2140/camcos.2010.5.65 · Cited by 3,075
Handbook of Markov Chain Monte Carlo
Brooks, S., Gelman, A., Jones, G., & Meng, X.-L. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b10905 · Cited by 2,993
MCMC Using Hamiltonian Dynamics
Neal, R. M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-6 · Cited by 2,574
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
Self-citation
Metadata
- Authors
- Andrieu, C., & Thoms, J.
- Venue
- Statistics and Computing
- Published
- 2008-12
- Volume
- 18
- Issue
- 4
- Pages
- 343-373
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2135973421
- Cited by
- 903
- References
- 65
- FWCI
- 27.01
- 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.