The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Robust adaptive Metropolis algorithm with coerced acceptance rate
Abstract
The adaptive Metropolis (AM) algorithm of Haario, Saksman and Tamminen (Bernoulli 7(2):223–242, 2001) uses the estimated covariance of the target distribution in the proposal distribution. This paper introduces a new robust adaptive Metropolis algorithm estimating the shape of the target distribution and simultaneously coercing the acceptance rate. The adaptation rule is computationally simple adding no extra cost compared with the AM algorithm. The adaptation strategy can be seen as a multidimensional extension of the previously proposed method adapting the scale of the proposal distribution in order to attain a given acceptance rate. The empirical results show promising behaviour of the new algorithm in an example with Student target distribution having no finite second moment, where the AM covariance estimate is unstable. In the examples with finite second moments, the performance of the new approach seems to be competitive with the AM algorithm combined with scale adaptation.
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
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Monte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
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
Wiley Series in Probability and Mathematics Statistics
(1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250.scard · Cited by 2,220
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
Markov Chain Monte Carlo in Practice
Gasparini, M. (1997) · Technometrics · doi:10.1080/00401706.1997.10485132 · Cited by 1,879
Stochastic Approximation and Recursive Algorithms and Applications
(2003) · Stochastic Modelling and Applied Probability · doi:10.1007/b97441 · Cited by 1,838
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
Cited by
Event Horizon Telescope Collaboration, Akiyama, K., Alberdi, A., Alef, W., Algaba, J. C., Anantua, R., Asada, K., Azulay, R., Bach, U., Baczko, A.-K., et al. (2022) · The Astrophysical Journal Letters · doi:10.3847/2041-8213/ac6736 · Cited by 369
Regime changes in Bitcoin GARCH volatility dynamics
Ardia, D., Bluteau, K., & Rüede, M. (2019) · Finance Research Letters · doi:10.1016/j.frl.2018.08.009 · Cited by 296
Kelly, B. C., Becker, A. C., Sobolewska, M., Siemiginowska, A., & Uttley, P. (2014) · The Astrophysical Journal · doi:10.1088/0004-637x/788/1/33 · Cited by 270
Adaptive 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-citation
Metadata
- Authors
- Vihola, M.
- Venue
- Statistics and Computing
- Published
- 2011-08-04
- Volume
- 22
- Issue
- 5
- Pages
- 997-1008
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2163669663
- Cited by
- 258
- References
- 29
- FWCI
- 4.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust adaptive Metropolis algorithm with coerced acceptance rate. https://app.cochat.ai/papers/10.1007/s11222-011-9269-5
- The paper
- Vihola, M. (2012). Robust adaptive Metropolis algorithm with coerced acceptance rate. Statistics and Computing. https://doi.org/10.1007/s11222-011-9269-5
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.