Time Series Particle Filter
Time Series Particle Filter (Sequential Monte Carlo for State-Space Models) · Also known as: SMC for time series, bootstrap particle filter, sequential importance resampling, particle filtering
The time series particle filter is a Sequential Monte Carlo method that tracks the hidden state of a nonlinear, non-Gaussian state-space model as new observations arrive one at a time. It represents the evolving posterior distribution over the latent state as a weighted cloud of random samples (particles), updating them at each time step through propagation, likelihood weighting, and resampling.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use the time series particle filter when the state-space model is nonlinear or when the process or observation noise is non-Gaussian — situations where the Kalman filter is exact only in theory but biased in practice. It is the method of choice for object tracking, target localisation, stochastic volatility estimation, epidemiological surveillance, and any sequential estimation problem where the posterior is multimodal or heavy-tailed. Avoid it when N (number of particles) affordable on your hardware is too small relative to the state dimension, because in high dimensions weight degeneracy is severe (the curse of dimensionality). For linear-Gaussian models the Kalman filter is exact and far cheaper. For very high-dimensional state spaces consider ensemble Kalman filter or other scalable alternatives.
Strengths & limitations
- Handles arbitrary nonlinear transition and observation models without linearisation approximations.
- Naturally accommodates non-Gaussian, multimodal, and heavy-tailed noise distributions.
- Provides a full approximate posterior over the latent state at every time step, not just a point estimate.
- Asymptotically consistent: as N grows the particle approximation converges to the true filtering distribution.
- Easily extended with parameter estimation (particle MCMC, SMC-squared) and smoothing (backward simulation).
- Computational cost scales linearly with N, which may need to be large for complex posteriors.
- Suffers from weight degeneracy in high state dimensions (curse of dimensionality), requiring specialised methods.
- Standard algorithms yield filtered estimates; obtaining smoothed estimates requires additional backward passes.
- Choosing the proposal distribution and resampling schedule requires expertise to achieve good performance.
Frequently asked
How many particles do I need?
There is no universal rule. Common starting points are N = 500 to N = 5000 for low-dimensional state spaces (dimension 1-5). Run the filter with increasing N and monitor whether posterior summaries stabilise. Effective sample size (ESS) at each step is a useful diagnostic; if ESS routinely falls below N/10, increase N or improve the proposal.
How does this differ from the Kalman filter?
The Kalman filter is exact only for linear-Gaussian state-space models and returns a Gaussian posterior described by a mean and covariance. The particle filter is a general approximation that works with any nonlinear, non-Gaussian model at the cost of greater computation. For linear-Gaussian models the Kalman filter is preferred; for everything else the particle filter (or an extended/unscented variant) is needed.
What is particle degeneracy and how is it fixed?
Degeneracy occurs when nearly all normalised weight concentrates on a single particle, so the effective sample size collapses. The standard fix is resampling: replace low-weight particles by duplicates of high-weight ones. Adaptive resampling — triggered only when ESS falls below a threshold — balances variance reduction against the cost of disrupting particle diversity.
Can I estimate model parameters as well as the latent state?
Yes. Particle MCMC (Andrieu, Doucet & Holenstein, 2010) uses particle filter likelihood estimates inside an MCMC sampler for the parameters. SMC-squared (Chopin, Jacob & Papaspiliopoulos, 2013) runs a second layer of SMC over the parameters. Both are substantially more expensive than filtering alone.
Is the particle filter the same as Sequential Monte Carlo?
The particle filter is the specific application of Sequential Monte Carlo (SMC) to state-space filtering. SMC is a broader family covering also static model estimation (via tempering) and normalising constant computation, so every particle filter is an SMC algorithm but not vice versa.
Sources
- Gordon, N. J., Salmond, D. J., & Smith, A. F. M. (1993). Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEE Proceedings F - Radar and Signal Processing, 140(2), 107-113. DOI: 10.1049/ip-f-2.1993.0015 ↗
- Doucet, A., de Freitas, N., & Gordon, N. (Eds.). (2001). Sequential Monte Carlo Methods in Practice. Springer. ISBN: 978-0387951461
How to cite this page
ScholarGate. (2026, June 3). Time Series Particle Filter (Sequential Monte Carlo for State-Space Models). ScholarGate. https://scholargate.app/en/bayesian/time-series-particle-filter
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Dynamic Bayesian NetworkBayesian↔ compare
- Kalman FilterBayesian↔ compare
- Particle FilterBayesian↔ compare
- Sequential Monte CarloBayesian↔ compare
- Time series Bayesian inferenceBayesian↔ compare
- Time Series Kalman FilterBayesian↔ compare