Creating non-reversible rejection-free samplers by rebalancing skew-balanced Markov jump processes
By: Erik Jansson , Moritz Schauer , Ruben Seyer and more
Potential Business Impact:
Makes computer guessing faster and more reliable.
Markov chain sampling methods form the backbone of modern computational statistics. However, many popular methods are prone to random walk behavior, i.e., diffusion-like exploration of the sample space, leading to slow mixing that requires intricate tuning to alleviate. Non-reversible samplers can resolve some of these issues. We introduce a device that turns jump processes that satisfy a skew-detailed balance condition for a reference measure into a process that samples a target measure that is absolutely continuous with respect to the reference measure. The resulting sampler is rejection-free, non-reversible, and continuous-time. As an example, we apply the device to Hamiltonian dynamics discretized by the leapfrog integrator, resulting in a rejection-free non-reversible continuous-time version of Hamiltonian Monte Carlo (HMC). We prove the geometric ergodicity of the resulting sampler under certain convexity conditions, and demonstrate its qualitatively different behavior to HMC through numerical examples.
Similar Papers
A fast non-reversible sampler for Bayesian finite mixture models
Computation
Speeds up computer learning for complex data.
Non-Reversible Langevin Algorithms for Constrained Sampling
Machine Learning (CS)
Helps computers learn from data with tricky rules.
Transient regime of piecewise deterministic Monte Carlo algorithms
Computation
Helps computers find answers faster in complex problems.