DeepAI AI Chat
Log In Sign Up

Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm

by   Randal Douc, et al.

The present paper focuses on the problem of sampling from a given target distribution π 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 π 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.


A large deviation principle for the empirical measures of Metropolis-Hastings chains

To sample from a given target distribution, Markov chain Monte Carlo (MC...

Regeneration-enriched Markov processes with application to Monte Carlo

We study a class of Markov processes comprising local dynamics governed ...

On the geometric convergence for MALA under verifiable conditions

While the Metropolis Adjusted Langevin Algorithm (MALA) is a popular and...

Ex^2MCMC: Sampling through Exploration Exploitation

We develop an Explore-Exploit Markov chain Monte Carlo algorithm (Ex^2MC...

Haar-Weave-Metropolis kernel

Recently, many Markov chain Monte Carlo methods have been developed with...

Towards sampling complex actions

Path integrals with complex actions are encountered for many physical sy...