Particle-based adaptive-lag online marginal smoothing in general state-space models

12/28/2018
by   Johan Alenlöv, et al.
0

We present a novel algorithm, an adaptive-lag smoother, approximating efficiently, in an online fashion, sequences of expectations under the marginal smoothing distributions in general state-space models. The algorithm evolves recursively a bank of estimators, one for each marginal, in resemblance with the so-called particle-based, rapid incremental smoother (PaRIS). Each estimator is propagated until a stopping criterion, measuring the fluctuations of the estimates, is met. The presented algorithm is furnished with theoretical results describing its asymptotic limit and memory usage.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2023

State and parameter learning with PaRIS particle Gibbs

Non-linear state-space models, also known as general hidden Markov model...
research
12/08/2020

Online Particle Smoothing with Application to Map-matching

We introduce a novel method for online smoothing in state-space models b...
research
08/01/2021

Fast and numerically stable particle-based online additive smoothing: the AdaSmooth algorithm

We present a novel sequential Monte Carlo approach to online smoothing o...
research
07/07/2023

Revisiting the Two-Filter Formula for Smoothing for State-Space Models

Smoothing algorithms for state-space models, i.e., fixed-interval smooth...
research
09/21/2022

Particle-based, rapid incremental smoother meets particle Gibbs

The particle-based, rapid incremental smoother (PARIS) is a sequential M...
research
10/20/2018

A defensive marginal particle filtering method for data assimilation

The Particle filtering (PF) method is often used to estimate the states ...
research
01/15/2022

Wigner's quasidistribution and Dirac's kets

In every state of a quantum particle, Wigner's quasidistribution is the ...

Please sign up or login with your details

Forgot password? Click here to reset