University of Cambridge > Talks.cam > Statistics > The Bouncy Particle Sampler

The Bouncy Particle Sampler

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Quentin Berthet.

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.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity