Fast particle smoothing: If I had a million particles
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 n...
Main Authors: | Klaas, M, Briers, M, De Freitas, N, Doucet, A, Maskell, S, Lang, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2006
|
Similar Items
-
Fast particle smoothing: If i had a million particles
by: Klaas, M, et al.
Published: (2006) -
Fast particle smoothing: if I had a million particles
by: Klaas, M, et al.
Published: (2006) -
Smoothing algorithms for state-space models
by: Briers, M, et al.
Published: (2010) -
Sequential auxiliary particle belief propagation
by: Briers, M, et al.
Published: (2005) -
Particle filters for graphical models
by: Briers, M, et al.
Published: (2006)