Generalized Bouncy Particle Sampler

Abstract

As a special example of piecewise deterministic Markov process, bouncy particle sampler is a rejection-free, irreversible Markov chain Monte Carlo algorithm and can draw samples from target distribution efficiently. We generalize bouncy particle sampler in terms of its transition dynamics. In BPS, the transition dynamic at event time is deterministic, but in GBPS, it is random. With the help of this randomness, GBPS can overcome the reducibility problem in BPS without refreshement.

Cited by in corpus (5)

• Ergodicity of the zigzag process
• On explicit $L^2$-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
• Concentration Inequalities and UQ Bounds for Hypocoercive MCMC Samplers
• Non-reversible, tuning- and rejection-free Markov chain Monte Carlo via iterated random functions
• Bouncy Hybrid Sampler as a Unifying Device