Piecewise deterministic Markov processes and efficiency gains through exact subsampling for MCMC
- đ¤ Speaker: Joris Bierkens (Delft University of Technology)
- đ Date & Time: Tuesday 18 July 2017, 10:20 - 11:00
- đ Venue: Seminar Room 1, Newton Institute
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Joris Bierkens (Delft University of Technology)
Tuesday 18 July 2017, 10:20-11:00