Fast particle smoothing: If I had a million particles

Journal article

We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2) algorithm, where N is the number of particles. We overcome this problem by integrating dual tree recursions and fast multipole techniques with forward-backward smoothers, a new generalized two-filter smoother and a maximum a posteriori (MAP) smoother. Our experiments show that these improvements can substantially increase the practicality of particle smoothing.

Authors: Klaas, M; Briers, M; De Freitas, N; Doucet, A; Maskell, S

• Journal: ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning
• Volume: 2006
• Pages: 481-488
• Publication date: 2006-01-01
• Language: English