The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Optimal tuning of the hybrid Monte Carlo algorithm
Open accessAbstract
We investigate the properties of the hybrid Monte Carlo algorithm (HMC) in high dimensions. HMC develops a Markov chain reversible with respect to a given target distribution $\Pi$ using separable Hamiltonian dynamics with potential $-\log\Pi$. The additional momentum variables are chosen at random from the Boltzmann distribution, and the continuous-time Hamiltonian dynamics are then discretised using the leapfrog scheme. The induced bias is removed via a Metropolis–Hastings accept/reject rule. In the simplified scenario of independent, identically distributed components, we prove that, to obtain an $\mathcal{O}(1)$ acceptance probability as the dimension $d$ of the state space tends to $\infty$, the leapfrog step size $h$ should be scaled as $h=l\times d^{-1/4}$. Therefore, in high dimensions, HMC requires $\mathcal{O}(d^{1/4})$ steps to traverse the state space. We also identify analytically the asymptotically optimal acceptance probability, which turns out to be $0.651$ (to three decimal places). This value optimally balances the cost of generating a proposal, which decreases as $l$ increases (because fewer steps are required to reach the desired final integration time), against the cost related to the average number of proposals required to obtain acceptance, which increases as $l$ increases.
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
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
Solving Ordinary Differential Equations II
Hairer, E., & Wanner, G. (1996) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05221-7 · Cited by 4,342
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Solving ordinary differential equations I. nonstiff problems
(1987) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(87)90083-8 · Cited by 4,077
Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987) · Physics Letters B · doi:10.1016/0370-2693(87)91197-x · Cited by 3,872
Geometric Numerical Integration
(2006) · Springer Series in Computational Mathematics · doi:10.1007/3-540-30666-8 · Cited by 3,118
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
Martingale Limit Theory and its Application
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10818-5 · Cited by 1,912
Geometric Numerical Integration
Hairer, E., Wanner, G., & Lubich, C. (2002) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-05018-7 · Cited by 1,704
Cited by
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
Mbalawata, I. S., Särkkä, S., & Haario, H. (2013) · Computational Statistics · doi:10.1007/s00180-012-0352-y · Cited by 77
Metadata
- Authors
- Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., & Stuart, A.
- Venue
- Bernoulli
- Published
- 2013-11-01
- Volume
- 19
- Issue
- 5A
- Pages
- 1501-1534
- ISSN
- 1350-7265 (ISSN-L)
- OpenAlex
- W1981514681
- Cited by
- 261
- References
- 47
- FWCI
- 18.06
- 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: Optimal tuning of the hybrid Monte Carlo algorithm. https://app.cochat.ai/papers/10.3150/12-bej414
- The paper
- Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., & Stuart, A. (2013). Optimal tuning of the hybrid Monte Carlo algorithm. Bernoulli. https://doi.org/10.3150/12-bej414
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.