A general perspective on the Metropolis-Hastings kernel

Abstract

Since its inception the Metropolis-Hastings kernel has been applied in sophisticated ways to address ever more challenging and diverse sampling problems. Its success stems from the flexibility brought by the fact that its verification and sampling implementation rests on a local ``detailed balance'' condition, as opposed to a global condition in the form of a typically intractable integral equation. While checking the local condition is routine in the simplest scenarios, this proves much more difficult for complicated applications involving auxiliary structures and variables. Our aim is to develop a framework making establishing correctness of complex Markov chain Monte Carlo kernels a purely mechanical or algebraic exercise, while making communication of ideas simpler and unambiguous by allowing a stronger focus on essential features -- a choice of embedding distribution, an involution and occasionally an acceptance function -- rather than the induced, boilerplate structure of the kernels that often tends to obscure what is important. This framework can also be used to validate kernels that do not satisfy detailed balance, i.e. which are not reversible, but a modified version thereof.

References in corpus (20)

• The pseudo-marginal approach for efficient Monte Carlo computations
• A Conceptual Introduction to Hamiltonian Monte Carlo
• Event-chain Monte Carlo algorithms for hard-sphere systems
• Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
• The Penalty Method for Random Walks with Uncertain Energies
• Piecewise-Deterministic Markov Chain Monte Carlo
• Event-chain Monte Carlo for classical continuous spin models
• Compressible Generalized Hybrid Monte Carlo
• Event-chain Monte Carlo algorithms for three- and many-particle interactions
• Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
• On the convergence of Hamiltonian Monte Carlo
• Hamiltonian Monte Carlo Without Detailed Balance
• Extra Chance Generalized Hybrid Monte Carlo
• Improving the Asymptotic Performance of Markov Chain Monte-Carlo by Inserting Vortices
• Comparison of asymptotic variances of inhomogeneous Markov chains with application to Markov chain Monte Carlo methods
• Generalized and hybrid Metropolis-Hastings overdamped Langevin algorithms
• MetFlow: A New Efficient Method for Bridging the Gap between Markov Chain Monte Carlo and Variational Inference
• Automating Involutive MCMC using Probabilistic and Differentiable Programming
• Metropolis-Hastings with Averaged Acceptance Ratios
• Nonreversible MCMC from conditional invertible transforms: a complete recipe with convergence guarantees

Cited by in corpus (5)

• Metropolis-Hastings with Averaged Acceptance Ratios
• Sampling algorithms in statistical physics: a guide for statistics and machine learning
• Delayed rejection Hamiltonian Monte Carlo for sampling multiscale distributions
• A Statistical Framework for Domain Shape Estimation in Stokes Flows
• Entropy-based adaptive Hamiltonian Monte Carlo