Interacting Particle Markov Chain Monte Carlo

02/16/2016
by   Tom Rainforth, et al.
0

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improvements in mixing rates relative to both non-interacting PMCMC samplers, and a single PMCMC sampler with an equivalent memory and computational budget. An additional advantage of the iPMCMC method is that it is suitable for distributed and multi-core architectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2019

Markov chain Monte Carlo algorithms with sequential proposals

We explore a general framework in Markov chain Monte Carlo (MCMC) sampli...
research
05/03/2013

Inference in Kingman's Coalescent with Particle Markov Chain Monte Carlo Method

We propose a new algorithm to do posterior sampling of Kingman's coalesc...
research
03/09/2017

Parallel Markov Chain Monte Carlo for the Indian Buffet Process

Indian Buffet Process based models are an elegant way for discovering un...
research
10/11/2015

Kernel Sequential Monte Carlo

We propose kernel sequential Monte Carlo (KSMC), a framework for samplin...
research
07/29/2019

Hug and Hop: a discrete-time, non-reversible Markov chain Monte Carlo algorithm

We introduced the Hug and Hop Markov chain Monte Carlo algorithm for est...
research
09/30/2019

Variance Estimation in Adaptive Sequential Monte Carlo

Sequential Monte Carlo (SMC) methods represent a classical set of techni...
research
06/04/2021

Estimating parking occupancy using smart meter transaction data

The excessive search for parking, known as cruising, generates pollution...

Please sign up or login with your details

Forgot password? Click here to reset