The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 21, Number 6 (2011), 2343-2378.
Analysis of error propagation in particle filters with approximation
This paper examines the impact of approximation steps that become necessary when particle filters are implemented on resource-constrained platforms. We consider particle filters that perform intermittent approximation, either by subsampling the particles or by generating a parametric approximation. For such algorithms, we derive time-uniform bounds on the weak-sense Lp error and present associated exponential inequalities. We motivate the theoretical analysis by considering the leader node particle filter and present numerical experiments exploring its performance and the relationship to the error bounds.
Ann. Appl. Probab., Volume 21, Number 6 (2011), 2343-2378.
First available in Project Euclid: 23 November 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Oreshkin, Boris N.; Coates, Mark J. Analysis of error propagation in particle filters with approximation. Ann. Appl. Probab. 21 (2011), no. 6, 2343--2378. doi:10.1214/11-AAP760. https://projecteuclid.org/euclid.aoap/1322057324