Optimal SIR algorithm vs. fully adapted auxiliary particle filter : a non asymptotic analysis - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Statistics and Computing Année : 2013

Optimal SIR algorithm vs. fully adapted auxiliary particle filter : a non asymptotic analysis

Résumé

Particle filters (PF) and auxiliary particle filters (APF) are widely used sequential Monte Carlo (SMC) techniques. In this paper we comparatively analyse, from a non asymptotic point of view, the Sampling Importance Resampling (SIR) PF with optimal conditional importance distribution (CID) and the fully adapted APF (FA). We compute the (finite samples) conditional second order moments of Monte Carlo (MC) estimators of a moment of interest of the filtering pdf, and analyse under which circumstances the FA-based estimator outperforms (or not) the optimal Sequential Importance Sampling (SIS)-based one. Our analysis is local, in the sense that we compare the estimators produced by one time step of the different SMC algorithms, starting from a common set of weighted points. This analysis enables us to propose a hybrid SIS/FA algorithm which automatically switches at each time step from one loop to the other. We finally validate our results via computer simulations.

Dates et versions

hal-00862193 , version 1 (16-09-2013)

Identifiants

Citer

Yohan Petetin, François Desbouvries. Optimal SIR algorithm vs. fully adapted auxiliary particle filter : a non asymptotic analysis. Statistics and Computing, 2013, 23 (6), pp.759-775. ⟨10.1007/s11222-012-9345-5⟩. ⟨hal-00862193⟩
145 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More