Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm
Preprint
Abstract
The present paper focuses on the problem of sampling from a given target distribution $\pi$ defined on some general state space. To this end, we introduce a novel class of non-reversible Markov chains, each chain being defined on an extended state space and having an invariant probability measure admitting $\pi$ as a marginal distribution. The proposed methodology is inspired by a new formulation of Kac's theorem and allows global and local dynamics to be smoothly combined. Under mild conditions, the corresponding Markov transition kernel can be shown to be irreducible and Harris recurrent. In addition, we establish that geometric ergodicity holds under appropriate conditions on the global and local dynamics. Finally, we illustrate numerically the use of the proposed method and its potential benefits in comparison to existing Markov chain Monte Carlo (MCMC) algorithms.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithmBiometrika, 2022
- Kinetic energy choice in Hamiltonian/hybrid Monte CarloBiometrika, 2019
- An Adaptive Interacting Wang–Landau Algorithm for Automatic Density ExplorationJournal of Computational and Graphical Statistics, 2013
- An Adaptive Parallel Tempering AlgorithmJournal of Computational and Graphical Statistics, 2013
- Nonparametric belief propagation for self-localization of sensor networksIEEE Journal on Selected Areas in Communications, 2005
- On the applicability of regenerative simulation in Markov chain Monte CarloBiometrika, 2002
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogramPhysical Review E, 2001
- Smart Darting Monte CarloThe Journal of Chemical Physics, 2001
- Sampling from multimodal distributions using tempered transitionsStatistics and Computing, 1996
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithmsBiometrika, 1996