pith. sign in

arxiv: 0709.3448 · v1 · submitted 2007-09-21 · 🧮 math.ST · stat.TH

On the auxiliary particle filter

classification 🧮 math.ST stat.TH
keywords particleasymptoticalgorithmauxiliaryfiltervariancearticlebesides
0
0 comments X
read the original abstract

In this article we study asymptotic properties of weighted samples produced by the auxiliary particle filter (APF) proposed by pitt and shephard (1999). Besides establishing a central limit theorem (CLT) for smoothed particle estimates, we also derive bounds on the Lp error and bias of the same for a finite particle sample size. By examining the recursive formula for the asymptotic variance of the CLT we identify first-stage importance weights for which the increase of asymptotic variance at a single iteration of the algorithm is minimal. In the light of these findings, we discuss and demonstrate on several examples how the APF algorithm can be improved.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.