On resampling schemes for particle filters with weakly informative observations

03/18/2022
by   Nicolas Chopin, et al.
0

We consider particle filters with weakly informative observations (or `potentials') relative to the latent state dynamics. The particular focus of this work is on particle filters to approximate time-discretisations of continuous-time Feynman–Kac path integral models – a scenario that naturally arises when addressing filtering and smoothing problems in continuous time – but our findings are indicative about weakly informative settings beyond this context too. We study the performance of different resampling schemes, such as systematic resampling, SSP (Srinivasan sampling process) and stratified resampling, as the time-discretisation becomes finer and also identify their continuous-time limit, which is expressed as a suitably defined `infinitesimal generator.' By contrasting these generators, we find that (certain modifications of) systematic and SSP resampling `dominate' stratified and independent `killing' resampling in terms of their limiting overall resampling rate. The reduced intensity of resampling manifests itself in lower variance in our numerical experiment. This efficiency result, through an ordering of the resampling rate, is new to the literature. The second major contribution of this work concerns the analysis of the limiting behaviour of the entire population of particles of the particle filter as the time discretisation becomes finer. We provide the first proof, under general conditions, that the particle approximation of the discretised continuous-time Feynman–Kac path integral models converges to a (uniformly weighted) continuous-time particle system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2022

Conditional particle filters with bridge backward sampling

The performance of the conditional particle filter (CPF) with backward s...
research
06/21/2022

De-biasing particle filtering for a continuous time hidden Markov model with a Cox process observation model

We develop a (nearly) unbiased particle filtering algorithm for a specif...
research
09/01/2022

Continuous-time Particle Filtering for Latent Stochastic Differential Equations

Particle filtering is a standard Monte-Carlo approach for a wide range o...
research
02/01/2019

Limit theorems for cloning algorithms

Large deviations for additive path functionals of stochastic processes h...
research
09/10/2019

Computer Assisted Composition in Continuous Time

We address the problem of combining sequence models of symbolic music wi...
research
07/24/2020

McKean-Vlasov SDEs in nonlinear filtering

Various particle filters have been proposed over the last couple of deca...
research
11/27/2020

A Unification of Weighted and Unweighted Particle Filters

Particle filters (PFs), which are successful methods for approximating t...

Please sign up or login with your details

Forgot password? Click here to reset