HMC: avoiding rejections by not using leapfrog and some results on the acceptance rate
arXiv:1912.03253
Abstract
The leapfrog integrator is routinely used within the Hamiltonian Monte Carlo method and its variants. We give strong numerical evidence that alternative, easy to implement algorithms yield fewer rejections with a given computational effort. When the dimensionality of the target distribution is high, the number of accepted proposals may be multiplied by a factor of three or more. This increase in the number of accepted proposals is not achieved by impairing any positive features of the sampling. We also establish new non-asymptotic and asymptotic results on the monotonic relationship between the expected acceptance rate and the expected energy error. These results further validate the derivation of one of the integrators we consider and are of independent interest.
arXiv comment37 pages, 8 figures
References in corpus (12)
- Stochastic Gradient Hamiltonian Monte Carlo
- On the Geometric Ergodicity of Hamiltonian Monte Carlo
- Randomized Hamiltonian Monte Carlo
- Geometric integrators and the Hamiltonian Monte Carlo method
- Splitting and composition methods in the numerical integration of differential equations
- Compressible Generalized Hybrid Monte Carlo
- Modified Hamiltonian Monte Carlo for Bayesian inference
- Extra Chance Generalized Hybrid Monte Carlo
- Adaptive multi-stage integrators for optimal energy conservation in molecular simulations
- Palindromic 3-stage splitting integrators, a roadmap
- Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?
- Multi-stage splitting integrators for sampling with modified Hamiltonian Monte Carlo methods