The DOI matches its Crossref record.
An Improved Acceptance Procedure for the Hybrid Monte Carlo Algorithm
Open accessAbstract
The probability of accepting a candidate move in the hybrid Monte Carlo algorithm can be increased by considering a transition to be between windows of several states at the beginning and end of the trajectory, with a particular state within the selected window then being chosen according to the Boltzmann probabilities. The detailed balance condition used to justify the algorithm still holds with this procedure, provided the start state is randomly positioned within its window. The new procedure is shown empirically to significantly improve the acceptance rate for a test system of uncoupled oscillators. It also allows expectations to be estimated using data from all states in the windows, rather than just states that are accepted.
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
Cited by
Stan : A Probabilistic Programming Language
Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., & Riddell, A. (2017) · Journal of Statistical Software · doi:10.18637/jss.v076.i01 · Cited by 7,754
“The MCMC samplers provided include Euclidean manifold Hamiltonian Monte Carlo (EHMC, or just HMC) (Duane, Kennedy, Pendleton, and Roweth 1987; Neal 1994, 2011) and the No-U-Turn sampler (NUTS) (Hoffman and Gelman 2011).”
MethodHandbook 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
Self-citationFournier, D. A., Skaug, H. J., Ancheta, J., Ianelli, J., Magnusson, A., Maunder, M. N., Nielsen, A., & Sibert, J. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2011.597854 · Cited by 1,739
The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
Hoffman, M. D., & Gelman, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.4246 · Cited by 1,713
Nested sampling for general Bayesian computation
Skilling, J. (2006) · Bayesian Analysis · doi:10.1214/06-ba127 · Cited by 1,670
A survey of uncertainty in deep neural networks
Gawlikowski, J., Tassi, C. R. N., Ali, M., Lee, J., Humt, M., Feng, J., Kruspe, A., Triebel, R., Jung, P., Roscher, R., et al. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10562-9 · Cited by 1,406
Neal, R. M. (2003) · The Annals of Statistics · doi:10.1214/aos/1056562461 · Cited by 1,361
Self-citationHuber, M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-10 · Cited by 1,176
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
Optimization Transfer Using Surrogate Objective Functions
Lange, K., Hunter, D. R., & Yang, I. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474858 · Cited by 808
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
A large-scale analysis of racial disparities in police stops across the United States
Pierson, E., Simoiu, C., Overgoor, J., Corbett-Davies, S., Jenson, D., Shoemaker, A., Ramachandran, V., Barghouty, P., Phillips, C., Shroff, R., et al. (2020) · Nature Human Behaviour · doi:10.1038/s41562-020-0858-1 · Cited by 552
A Conceptual Introduction to Hamiltonian Monte Carlo
Betancourt, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.02434 · Cited by 509
Can We Learn To Distinguish between “Drug-like” and “Nondrug-like” Molecules?
Ajay, Walters, W. P., & Murcko, M. A. (1998) · Journal of Medicinal Chemistry · doi:10.1021/jm970666c · Cited by 484
Monte Carlo Implementation of Gaussian Process Models for Bayesian Regression and Classification
Neal, R. M. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/9701026 · Cited by 375
Self-citationCheung, S. H., & Beck, J. L. (2009) · Journal of Engineering Mechanics · doi:10.1061/(asce)0733-9399(2009)135:4(243 · Cited by 317
Parameterization and Bayesian Modeling
Gelman, A. (2004) · Journal of the American Statistical Association · doi:10.1198/016214504000000458 · Cited by 275
The problem of infra-marginality in outcome tests for discrimination
Simoiu, C., Corbett-Davies, S., & Goel, S. (2017) · The Annals of Applied Statistics · doi:10.1214/17-aoas1058 · Cited by 154
“Given the observed data, we estimate the posterior distribution of the search thresholds via Hamiltonian Monte Carlo (HMC) sampling (Neal, 1994; Duane et al., 1987), a form of Markov chain Monte Carlo sampling (Metropolis et al.”
Method
Metadata
- Authors
- Neal, R. M.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 1994-03
- Volume
- 111
- Issue
- 1
- Pages
- 194-203
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W1985715247
- Cited by
- 178
- References
- 0
- FWCI
- 2.08
- 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.