The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Examples of Adaptive MCMC
Abstract
We investigate the use of adaptive MCMC algorithms to automatically tune the Markov chain parameters during a run. Examples include the Adaptive Metropolis (AM) multivariate algorithm of Haario, Saksman, and Tamminen (2001), Metropolis-within-Gibbs algorithms for nonconjugate hierarchical models, regionally adjusted Metropolis algorithms, and logarithmic scalings. Computer simulations indicate that the algorithms perform very well compared to nonadaptive algorithms, even in high dimension.
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
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
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 3×
“MCMC algorithms such as the Metropolis-Hastings algorithm (Metropolis et al., 1953; Hastings, 1970) are extremely widely used in statistical inference, to sample from complicated high-dimensional distributions.”
MethodSampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
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 4×
“(Such an acceptance rate is optimal in certain high-dimensional settings; see Roberts et al., 1997; Roberts and Rosenthal, 1998, 2001; B´edard, 2006a, 2006b, and we envisage that typically X i would be a space of the same dimension as X .)”
BackgroundMethodInfluentialSelf-citationHuber, P. J. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4612-0667-5_6 · Cited by 1,551
Sampling-Based Approaches to Calculating Marginal Densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.2307/2289776 · Cited by 1,504
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-citationData Analysis Using Stein's Estimator and its Generalizations
Efron, B., & Morris, C. (1975) · Journal of the American Statistical Association · doi:10.1080/01621459.1975.10479864 · Cited by 841
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
Self-citationRates 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
Adaptive proposal distribution for random walk Metropolis algorithm
Haario, H., Saksman, E., & Tamminen, J. (1999) · Computational Statistics · doi:10.1007/s001800050022 · Cited by 417
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
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-citationMarkov Chains for Exploring Posteior Distributions
Tierny, L. (1991) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 222
Componentwise adaptation for high dimensional MCMC
Haario, H., Saksman, E., & Tamminen, J. (2005) · Computational Statistics · doi:10.1007/bf02789703 · Cited by 221
Data Analysis Using Stein's Estimator and its Generalizations
Efron, B., & Morris, C. N. (1975) · Journal of the American Statistical Association · doi:10.2307/2285814 · Cited by 137
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
Coupling and Ergodicity of Adaptive MCMC
Rosenthal, J. S. (2007) · Cited by 94
Self-citationParametric Empirical Bayes Confidence Intervals
Morris, C. N. (1983) · Elsevier eBooks · doi:10.1016/b978-0-12-121160-8.50008-9 · Cited by 84
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
Analysis of the Gibbs sampler for a model related to James-Stein estimators
Rosenthal, J. S. (1996) · Statistics and Computing · doi:10.1007/bf00140871 · Cited by 66
Self-citationOn 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
Self-citationTwo convergence properties of hybrid samplers
Roberts, G. O., & Rosenthal, J. S. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1028903533 · Cited by 41
Self-citationBGX: a Bioconductor package for the Bayesian integrated analysis of Affymetrix GeneChips
Turro, E., Bochkina, N., Hein, A.-M. K., & Richardson, S. T. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-439 · Cited by 27
Cited by
MrBayes 3.2: Efficient Bayesian Phylogenetic Inference and Model Choice Across a Large Model Space
Ronquist, F., Teslenko, M., van der Mark, P., Ayres, D. L., Darling, A., Höhna, S., Larget, B., Liu, L., Suchard, M. A., & Huelsenbeck, J. P. (2012) · Systematic Biology · doi:10.1093/sysbio/sys029 · Cited by 27,843
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
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
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
A simple introduction to Markov Chain Monte–Carlo sampling
van Ravenzwaaij, D., Cassey, P., & Brown, S. D. (2018) · Psychonomic Bulletin & Review · doi:10.3758/s13423-016-1015-8 · Cited by 621
Metadata
- Authors
- Roberts, G. O., & Rosenthal, J. S.
- Venue
- Journal of Computational and Graphical Statistics
- Publisher
- Informa UK Limited
- Published
- 2009-01
- Volume
- 18
- Issue
- 2
- Pages
- 349-367
- ISSN
- 1061-8600 (ISSN-L)
- 1537-2715
- OpenAlex
- W2047978125
- Cited by
- 1,028
- References
- 27
- FWCI
- 43.73
- 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.