Simple conditions for convergence of sequential Monte Carlo genealogies with applications

06/30/2020
by   Suzie Brown, et al.
0

Sequential Monte Carlo algorithms are popular methods for approximating integrals in problems such as non-linear filtering and smoothing. Their performance depends strongly on the properties of an induced genealogical process. We present simple conditions under which the limiting process, as the number of particles grows, is a time-rescaled Kingman coalescent. We establish these conditions for standard sequential Monte Carlo with a broad class of low-variance resampling schemes, as well as for conditional sequential Monte Carlo with multinomial resampling.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/23/2018

Adaptive Tuning Of Hamiltonian Monte Carlo Within Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers form an attractive alternative to ...
07/03/2018

Limit theorems for sequential MCMC methods

Sequential Monte Carlo (SMC) methods, also known as particle filters, co...
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...
01/18/2018

Monte Carlo Computation for Generalized Linear Model

Monte Carlo method is a broad class of computational algorithms that rel...
04/21/2019

Particle filter efficiency under limited communication

Sequential Monte Carlo (SMC) methods are typically not straightforward t...
02/15/2021

Method Monte-Carlo for solving of non-linear integral equations

We offer in this short report a simple Monte-Carlo method for solving a ...
10/29/2021

The divide-and-conquer sequential Monte Carlo algorithm: theoretical properties and limit theorems

We revisit the divide-and-conquer sequential Monte Carlo (DaC-SMC) algor...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.