Markov chain Monte Carlo methods have become standard tools to sample from complex high-dimensional probability measures. Many available techniques rely on discrete-time reversible Markov chains whose transition kernels built up over the Metropolis-Hastings algorithm. In our recent work, we investigate an alternative approach, the Bouncy Particle Sampler (BPS) where the target distribution of interest is explored using a continuous-time, non reversible Markov process. In this alternative approach, a particle moves along straight lines continuously around the space and, when facing a high energy barrier, it is not rejected but its path is modified by bouncing against this barrier. The resulting non-reversible Markov process provides a rejection-free Markov chain Monte Carlo sampling scheme. This method, inspired from recent work in the molecular simulation literature, is shown to be a valid, efficient sampling scheme applicable to a wide range of Bayesian problems. We present several additional original methodological extensions and establish various theoretical properties of these procedures. We demonstrate experimentally the efficiency of these algorithms on a variety of Bayesian inference problems.
- Speaker: Alexandre Bouchard-Côté (UBC)
- Friday 05 May 2017, 16:00–17:00
- Venue: MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge..
- Series: Statistics; organiser: Quentin Berthet.