Bernoulli Race Particle Filters

03/03/2019
by   Sebastian M. Schmon, et al.
1

When the weights in a particle filter are not available analytically, standard resampling methods cannot be employed. To circumvent this problem state-of-the-art algorithms replace the true weights with non-negative unbiased estimates. This algorithm is still valid but at the cost of higher variance of the resulting filtering estimates in comparison to a particle filter using the true weights. We propose here a novel algorithm that allows for resampling according to the true intractable weights when only an unbiased estimator of the weights is available. We demonstrate our algorithm on several examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2022

Adaptive exact-approximate sequential Monte Carlo

Exact-approximate sequential Monte Carlo (SMC) methods target the exact ...
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
04/04/2022

Variance estimation for Sequential Monte Carlo Algorithms: a backward sampling approach

In this paper, we consider the problem of online asymptotic variance est...
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
08/08/2022

Monte Carlo twisting for particle filters

We consider the problem of designing efficient particle filters for twis...
research
06/16/2019

A tunable multiresolution smoother for scattered data with application to particle filtering

A smoothing algorithm is presented that can reduce the small-scale conte...
research
07/25/2016

Estimating Activity at Multiple Scales using Spatial Abstractions

Autonomous robots operating in dynamic environments must maintain belief...

Please sign up or login with your details

Forgot password? Click here to reset