Compressible Generalized Hybrid Monte Carlo

Abstract

One of the most demanding calculations is to generate random samples from a specified probability distribution (usually with an unknown normalizing prefactor) in a high-dimensional configuration space. One often has to resort to using a Markov chain Monte Carlo method, which converges only in the limit to the prescribed distribution. Such methods typically inch through configuration space step by step, with acceptance of a step based on a Metropolis(-Hastings) criterion. An acceptance rate of 100% is possible in principle by embedding configuration space in a higher-dimensional phase space and using ordinary differential equations. In practice, numerical integrators must be used, lowering the acceptance rate. This is the essence of hybrid Monte Carlo methods. Presented is a general framework for constructing such methods under relaxed conditions: the only geometric property needed is (weakened) reversibility; volume preservation is not needed. The possibilities are illustrated by deriving a couple of explicit hybrid Monte Carlo methods, one based on barrier-lowering variable-metric dynamics and another based on isokinetic dynamics.

27 pages, 2 figures

References in corpus (2)

• Numerical integrators for the Hybrid Monte Carlo method
• Hamiltonian Monte Carlo Without Detailed Balance

Cited by in corpus (24)

• Randomized Hamiltonian Monte Carlo
• Geometric integrators and the Hamiltonian Monte Carlo method
• Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods
• Emulation of Higher-Order Tensors in Manifold Monte Carlo Methods for Bayesian Inverse Problems
• On the convergence of Hamiltonian Monte Carlo
• Modified Hamiltonian Monte Carlo for Bayesian inference
• Extra Chance Generalized Hybrid Monte Carlo
• Palindromic 3-stage splitting integrators, a roadmap
• Convergence of unadjusted Hamiltonian Monte Carlo for mean-field models
• Geometrically Tempered Hamiltonian Monte Carlo
• A general perspective on the Metropolis-Hastings kernel
• Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents
• Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario
• Multiple projection MCMC algorithms on submanifolds
• Recycling intermediate steps to improve Hamiltonian Monte Carlo
• Nonreversible MCMC from conditional invertible transforms: a complete recipe with convergence guarantees
• HMC: avoiding rejections by not using leapfrog and some results on the acceptance rate
• A Unifying and Canonical Description of Measure-Preserving Diffusions
• Cayley Splitting for Second-Order Langevin Stochastic Partial Differential Equations
• Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integration
• Zigzag path connects two Monte Carlo samplers: Hamiltonian counterpart to a piecewise deterministic Markov process
• Hybrid Monte Carlo with Chaotic Mixing
• Improving the convergence of Markov chains via permutations and projections
• Improving sampling efficacy on high dimensional distributions with thin high density regions using Conservative Hamiltonian Monte Carlo