The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An Adaptive Metropolis Algorithm
Abstract
A proper choice of a proposal distribution for MCMC methods, e.g. for the Metropolis-Hastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis Algorithm (AM), where the Gaussian proposal distribution is updated along the process using the full information cumulated so far. Due to the adaptive nature of the process, the AM algorithm is non-Markovian, but we establish here that it has the correct ergodic properties. We also include the results of our numerical tests, which indicate that the AM algorithm competes well with traditional MetropolisHastings algorithms, and demonstrate that AM provides an easy to use algorithm for practical computation. 1991 Mathematics Subject Classification: 65C05, 65U05. Keywords: adaptive MCMC, comparison, convergence, ergodicity, Markov Chain Monte Carlo, Metropolis-Hastings algorithm 1 Introduction It is generally acknowledged that the choice of an effective proposal...
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
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 1×
“Finally, in Section 5 we present results from test simulations, where the AM algorithm is compared with traditional Metropolis±Hastings algorithms (Hastings 1970) by applying both linear and nonlinear, correlated and uncorrelated unimodal target distributions.”
MethodMarkov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
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
Martingale Limit Theory and its Application
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10818-5 · Cited by 1,912
Monte Carlo: Concepts, Algorithms, and Applications
Wasserstein, R. L. (1997) · Technometrics · doi:10.1080/00401706.1997.10485133 · Cited by 1,790
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×
“This choice concerns both the size and the spatial orientation of the proposal distribution, which are often very dif®cult to choose well since the target density is unknown (see Gelman et al. 1996; Gilks et al. 1995; 1998; Haario et al. 1999; Roberts et al. 1997).”
BackgroundHuber, P. J. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4612-0667-5_6 · Cited by 1,551
General Irreducible Markov Chains and Non-Negative Operators.
Rao, M. B., & Nummelin, E. (1985) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981963 · Cited by 599
Introducing Markov chain Monte Carlo
(1995) · Markov Chain Monte Carlo in Practice · doi:10.1201/b14835-6 · Cited by 510
A Maximal Inequality and Dependent Strong Laws
McLeish, D. L. (1975) · The Annals of Probability · doi:10.1214/aop/1176996269 · Cited by 423
Cited by
MCMC Methods for Multi-Response Generalized Linear Mixed Models: The MCMCglmmR Package
Hadfield, J. D. (2010) · Journal of Statistical Software · doi:10.18637/jss.v033.i02 · Cited by 4,799
THE AVERAGE STAR FORMATION HISTORIES OF GALAXIES IN DARK MATTER HALOS FROM z = 0-8
Behroozi, P. S., Wechsler, R. H., & Conroy, C. (2013) · The Astrophysical Journal · doi:10.1088/0004-637x/770/1/57 · Cited by 2,167
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
Haario, H., Laine, M., Mira, A., & Saksman, E. (2006) · Statistics and Computing · doi:10.1007/s11222-006-9438-0 · Cited by 1,498
Self-citationA terrestrial planet candidate in a temperate orbit around Proxima Centauri
Anglada-Escudé, G., Amado, P. J., Barnes, J., Berdiñas, Z. M., Butler, R. P., Coleman, G. A. L., de la Cueva, I., Dreizler, S., Endl, M., Giesers, B., et al. (2016) · Nature · doi:10.1038/nature19106 · Cited by 1,282
UniverseMachine: The correlation between galaxy growth and dark matter halo assembly from z = 0−10
Behroozi, P., Wechsler, R. H., Hearin, A. P., & Conroy, C. (2019) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stz1182 · Cited by 1,243
Vrugt, J. A., Gupta, H. V., Bouten, W., & Sorooshian, S. (2003) · Water Resources Research · doi:10.1029/2002wr001642 · Cited by 1,196
Vrugt, J. A., ter Braak, C. J. F., Diks, C. G. H., Robinson, B. A., Hyman, J. M., & Higdon, D. (2009) · International Journal of Nonlinear Sciences and Numerical Simulation · doi:10.1515/ijnsns.2009.10.3.273 · Cited by 1,145
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
Roberts, G. O., & Rosenthal, J. S. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.06134 · Cited by 1,028
Programming With Models: Writing Statistical Algorithms for General Model Structures With NIMBLE
de Valpine, P., Turek, D., Paciorek, C. J., Anderson-Bergman, C., Lang, D. T., & Bodik, R. (2017) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2016.1172487 · Cited by 998
Microbial carbon use efficiency promotes global soil carbon storage
Tao, F., Huang, Y., Hungate, B. A., Manzoni, S., Frey, S. D., Schmidt, M. W. I., Reichstein, M., Carvalhais, N., Ciais, P., Jiang, L., et al. (2023) · Nature · doi:10.1038/s41586-023-06042-3 · Cited by 938
Braak, C. J. F. T. (2006) · Statistics and Computing · doi:10.1007/s11222-006-8769-1 · Cited by 937
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
MontePython 3: Boosted MCMC sampler and other features
Brinckmann, T., & Lesgourgues, J. (2019) · Physics of the Dark Universe · doi:10.1016/j.dark.2018.100260 · Cited by 683
Efficient quantum memory for light
Hedges, M. P., Longdell, J. J., Li, Y., & Sellars, M. J. (2010) · Nature · doi:10.1038/nature09081 · Cited by 617
Improved evolutionary optimization from genetically adaptive multimethod search
Vrugt, J. A., & Robinson, B. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610471104 · Cited by 614
Differential Evolution Markov Chain with snooker updater and fewer chains
ter Braak, C. J. F., & Vrugt, J. A. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9104-9 · Cited by 591
Bayesian analysis of input uncertainty in hydrological modeling: 1. Theory
Kavetski, D., Kuczera, G., & Franks, S. W. (2006) · Water Resources Research · doi:10.1029/2005wr004368 · Cited by 580
Efficient sampling of fast and slow cosmological parameters
Lewis, A. (2013) · Physical Review D · doi:10.1103/physrevd.87.103529 · Cited by 564
Dealing with uncertainty in model updating for damage assessment: a review
Simoen, E., De Roeck, G., & Lombaert, G. (2015) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2014.11.001 · Cited by 540
Laloy, E., & Vrugt, J. A. (2012) · Water Resources Research · doi:10.1029/2011wr010608 · Cited by 530
Cappé, O., Guillin, A., Marin, J. M., & Robert, C. P. (2004) · Journal of Computational and Graphical Statistics · doi:10.1198/106186004x12803 · Cited by 472
The LCES HIRES/Keck Precision Radial Velocity Exoplanet Survey
Butler, R. P., Vogt, S. S., Laughlin, G., Burt, J. A., Rivera, E. J., Tuomi, M., Teske, J., Arriagada, P., Diaz, M., Holden, B., et al. (2017) · The Astronomical Journal · doi:10.3847/1538-3881/aa66ca · Cited by 461
The geometric foundations of Hamiltonian Monte Carlo
Betancourt, M., Byrne, S., Livingstone, S., & Girolami, M. (2017) · Bernoulli · doi:10.3150/16-bej810 · Cited by 452
Simulation-based optimal bayesian experimental design for nonlinear systems
Huan, X., & Marzouk, Y. M. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.08.013 · Cited by 438
“Two useful improvements to MH are the concepts of delayed rejection (DR) [77, 78] and adaptive Metropolis (AM) [79]; combining these lead to the DRAM algorithm of Haario et al.”
MethodSeismic tomography with the reversible jump algorithm
Bodin, T., & Sambridge, M. (2009) · Geophysical Journal International · doi:10.1111/j.1365-246x.2009.04226.x · Cited by 439
MCMC algorithms for Subset Simulation
Papaioannou, I., Betz, W., Zwirglmaier, K., & Straub, D. (2015) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2015.06.006 · Cited by 409
Schütt, H. H., Harmeling, S., Macke, J. H., & Wichmann, F. A. (2016) · Vision Research · doi:10.1016/j.visres.2016.02.002 · Cited by 402
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
A dynamically-packed planetary system around GJ 667C with three super-Earths in its habitable zone
Anglada-Escudé, G., Tuomi, M., Gerlach, E., Barnes, R., Heller, R., Jenkins, J. S., Wende, S., Vogt, S. S., Paul Butler, R., Reiners, A., et al. (2013) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201321331 · Cited by 381
Statistical inversion and Monte Carlo sampling methods in electrical impedance tomography
Kaipio, J. P., Kolehmainen, V., Somersalo, E., & Vauhkonen, M. (2000) · Inverse Problems · doi:10.1088/0266-5611/16/5/321 · Cited by 363
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
On adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Sadegh, M., Ragno, E., & AghaKouchak, A. (2017) · Water Resources Research · doi:10.1002/2016wr020242 · Cited by 347
Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces
Vrugt, J. A., Robinson, B. A., & Hyman, J. M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924428 · Cited by 334
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
Nightside condensation of iron in an ultrahot giant exoplanet
Ehrenreich, D., Lovis, C., Allart, R., Zapatero Osorio, M. R., Pepe, F., Cristiani, S., Rebolo, R., Santos, N. C., Borsa, F., Demangeon, O., et al. (2020) · Nature · doi:10.1038/s41586-020-2107-1 · Cited by 309
Markov Chain Monte Carlo Methods for Bayesian Data Analysis in Astronomy
Sharma, S. (2017) · Annual Review of Astronomy and Astrophysics · doi:10.1146/annurev-astro-082214-122339 · Cited by 298
Methanogenesis in oxygenated soils is a substantial fraction of wetland methane emissions
Angle, J. C., Morin, T. H., Solden, L. M., Narrowe, A. B., Smith, G. J., Borton, M. A., Rey-Sanchez, C., Daly, R. A., Mirfenderesgi, G., Hoyt, D. W., et al. (2017) · Nature Communications · doi:10.1038/s41467-017-01753-4 · 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
Humphrey, G. B., Gibbs, M. S., Dandy, G. C., & Maier, H. R. (2016) · Journal of Hydrology · doi:10.1016/j.jhydrol.2016.06.026 · Cited by 273
Laloy, E., Rogiers, B., Vrugt, J. A., Mallants, D., & Jacques, D. (2013) · Water Resources Research · doi:10.1002/wrcr.20226 · Cited by 264
Robust adaptive Metropolis algorithm with coerced acceptance rate
Vihola, M. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9269-5 · Cited by 258
Active Preference-Based Learning of Reward Functions
Sadigh, D., Dragan, A., Sastry, S., & Seshia, S. (2017) · Robotics: Science and Systems XIII · doi:10.15607/rss.2017.xiii.053 · Cited by 255
Properties of cell death models calibrated and compared using Bayesian approaches
Eydgahi, H., Chen, W. W., Muhlich, J. L., Vitkup, D., Tsitsiklis, J. N., & Sorger, P. K. (2013) · Molecular Systems Biology · doi:10.1038/msb.2012.69 · Cited by 84
Neural computations underpinning the strategic management of influence in advice giving
Hertz, U., Palminteri, S., Brunetti, S., Olesen, C., Frith, C. D., & Bahrami, B. (2017) · Nature Communications · doi:10.1038/s41467-017-02314-5 · Cited by 77
New planetary systems from the Calan–Hertfordshire Extrasolar Planet Search
Jenkins, J. S., Jones, H. R. A., Tuomi, M., Díaz, M., Cordero, J. P., Aguayo, A., Pantoja, B., Arriagada, P., Mahu, R., Brahm, R., et al. (2017) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stw2811 · Cited by 66
“…algorithm (DRAM; Haario et al. 2006) together with tempered Markov chains when searching for solutions to our Keplerian models (see Tuomi 2014; Tuomi et al. 2014) and the simpler adaptive-Metropolis algorithm (Haario et al. 2001) when obtaining estimates for the model parameters.”
MethodAdaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter
Mbalawata, I. S., Särkkä, S., Vihola, M., & Haario, H. (2015) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2014.10.006 · Cited by 54
Self-citationFletcher, S. J., Iqbal, M., Jabbari, S., Stekel, D., & Rappoport, J. Z. (2014) · PLoS ONE · doi:10.1371/journal.pone.0111176 · Cited by 25
Muhirwa, J. P., Mbalawata, S. I., & Masanja, V. G. (2021) · Engineering, Technology & Applied Science Research · doi:10.48084/etasr.3962 · Cited by 9
Metadata
- Authors
- Haario, H., Saksman, E., & Tamminen, J.
- Venue
- Bernoulli
- Publisher
- JSTOR
- Published
- 2001-04
- Volume
- 7
- Issue
- 2
- Pages
- 223
- ISSN
- 1350-7265 (ISSN-L)
- OpenAlex
- W1995780830
- Cited by
- 2,631
- References
- 16
- FWCI
- 10.65
- 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.