Asynchronous Anytime Sequential Monte Carlo

07/10/2014
by   Brooks Paige, et al.
0

We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm in the sense that it can be run forever to emit an unbounded number of particles while keeping within a fixed memory budget. We prove that the particle cascade is an unbiased marginal likelihood estimator which means that it can be straightforwardly plugged into existing pseudomarginal methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2019

Particle filter with rejection control and unbiased estimator of the marginal likelihood

We consider the combined use of resampling and partial rejection control...
research
09/30/2021

Variational Marginal Particle Filters

Variational inference for state space models (SSMs) is known to be hard ...
research
11/13/2015

k-means: Fighting against Degeneracy in Sequential Monte Carlo with an Application to Tracking

For regular particle filter algorithm or Sequential Monte Carlo (SMC) me...
research
05/08/2018

Subsampling Sequential Monte Carlo for Static Bayesian Models

Our article shows how to carry out Bayesian inference by combining data ...
research
05/05/2023

Counterexample to a transition probability formula for the ancestral process

We consider weighted particle systems in which new generations are re-sa...
research
04/05/2018

Asymptotic genealogies of interacting particle systems with an application to sequential Monte Carlo

We consider weighted particle systems of fixed size, in which a new gene...
research
06/10/2020

When is Particle Filtering Efficient for POMDP Sequential Planning?

Particle filtering is a popular method for inferring latent states in st...

Please sign up or login with your details

Forgot password? Click here to reset