skip to content
 

Piecewise deterministic Markov processes and efficiency gains through exact subsampling for MCMC

Presented by: 
Joris Bierkens Delft University of Technology
Date: 
Tuesday 18th July 2017 - 10:20 to 11:00
Venue: 
INI Seminar Room 1
Abstract: 
Markov chain Monte Carlo methods provide an essential tool in statistics for sampling from complex probability distributions. While the standard approach to MCMC involves constructing discrete-time reversible Markov chains whose transition kernel is obtained via the Metropolis- Hastings algorithm, there has been recent interest in alternative schemes based on piecewise deterministic Markov processes (PDMPs). One such approach is based on the Zig-Zag process, introduced in Bierkens and Roberts (2016), which proved to provide a highly scalable sampling scheme for sampling in the big data regime (Bierkens, Fearnhead and Roberts (2016)). In this talk we will present a broad overview of these methods along with some theoretical results.



The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons