Variance estimation for sequential Monte Carlo algorithms: A backward sampling approach

Yazid Janati El Idrissi, Sylvain Le Corff, Yohan Petetin

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider the problem of online asymptotic variance estimation for particle filtering and smoothing. Current solutions for the particle filter rely on the particle genealogy and are either unstable or hard to tune in practice. We propose to mitigate these limitations by introducing a new estimator of the asymptotic variance based on the so called backward weights. The resulting estimator is weakly consistent and trades computational cost for more stability and reduced variance. We also propose a more computationally efficient estimator inspired by the PaRIS algorithm of (Bernoulli 23 (2017) 1951–1996). As an application, particle smoothing is considered and an estimator of the asymptotic variance of the Forward Filtering Backward Smoothing estimator applied to additive functionals is provided.

Original languageEnglish
Pages (from-to)911-935
Number of pages25
JournalBernoulli
Volume30
Issue number2
DOIs
Publication statusPublished - 1 Feb 2024

Keywords

  • Asymptotic variance
  • central limit theorem
  • particle filtering
  • particle smoothing
  • sequential Monte Carlo methods

Fingerprint

Dive into the research topics of 'Variance estimation for sequential Monte Carlo algorithms: A backward sampling approach'. Together they form a unique fingerprint.

Cite this