A non asymptotical analysis of the optimal SIR algorithm vs. the fully adapted auxiliary particle filter

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Particle filters (PF) and auxiliary particle filters (APF) are widely used sequential Monte Carlo (SMC) techniques for estimating the a posteriori filtering probability density function (pdf) in a Hidden Markov Chain (HMC). These algorithms have been theoretically analysed from an asymptotical statistics perspective. In this paper we provide a non asymptotical, finite number of samples comparative analysis of two particular SMC algorithms : the Sampling Importance Resampling (SIR) PF with optimal conditional importance distribution (CID), and the fully adapted APF (FA). Starting from a common set of N particles, we compute closed form expressions of the mean and variance of the empirical Monte Carlo (MC) estimators of a moment of the a posteriori filtering pdf. Both algorithms have the same mean, but in the case where resampling is used, the variance of the SIR algorithm always exceeds that of the FA algorithm.

Original languageEnglish
Title of host publication2011 IEEE Statistical Signal Processing Workshop, SSP 2011
Pages213-216
Number of pages4
DOIs
Publication statusPublished - 5 Sept 2011
Event2011 IEEE Statistical Signal Processing Workshop, SSP 2011 - Nice, France
Duration: 28 Jun 201130 Jun 2011

Publication series

NameIEEE Workshop on Statistical Signal Processing Proceedings

Conference

Conference2011 IEEE Statistical Signal Processing Workshop, SSP 2011
Country/TerritoryFrance
CityNice
Period28/06/1130/06/11

Keywords

  • Auxiliary Particle Filtering
  • Sequential Monte Carlo
  • non asymptotical analysis

Fingerprint

Dive into the research topics of 'A non asymptotical analysis of the optimal SIR algorithm vs. the fully adapted auxiliary particle filter'. Together they form a unique fingerprint.

Cite this