Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Bayesian›Robust Sequential Monte Carlo
Bayesian methodsBayesian / computational

Robust Sequential Monte Carlo

Robust Sequential Monte Carlo Methods · Also known as: robust particle filter, robust SMC, outlier-robust particle filtering, heavy-tailed SMC

Robust Sequential Monte Carlo (Robust SMC) extends standard particle filtering to handle outliers, heavy-tailed noise, and model misspecification in sequential data. By replacing Gaussian likelihood assumptions with heavier-tailed distributions or employing outlier-detection strategies during particle weighting, it maintains accurate state-tracking and parameter estimation even when observations deviate from the assumed model.

ScholarGate
  1. Bayesian methods
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Robust Sequential Monte Carlo
Hamiltonian Monte CarloKalman FilterParticle FilterRobust Bayesian InferenceRobust Kalman FilterSequential Monte CarloRobust Particle Filter

When to use it

Use Robust SMC when tracking hidden states in sequential data where observations may contain outliers, sensor glitches, or heavy-tailed noise — common in robotics, econometrics, environmental monitoring, and signal processing. It is preferable to standard particle filtering whenever the Gaussian noise assumption is questionable and filter collapse from outliers is a practical risk. Do not use it when the observation model is well-specified and Gaussian — standard SMC is computationally cheaper and equally accurate in that case. Also avoid it when the computational budget is very tight, since robust proposals and resampling schemes add overhead.

Strengths & limitations

Strengths
  • Maintains stable sequential estimates when outliers or heavy-tailed noise are present.
  • Fully nonlinear and non-Gaussian: no Gaussian approximation is required for the state or observation model.
  • Flexible: robustification can be applied via the likelihood, the proposal, or post-hoc weight corrections.
  • Provides a full posterior distribution over the hidden state at each time step, not just a point estimate.
  • Naturally handles non-stationary dynamics and time-varying parameters.
Limitations
  • Computationally expensive: scales poorly with state dimension (the curse of dimensionality).
  • Requires careful selection of the robust likelihood or proposal; a poor choice can degrade performance compared to standard SMC.
  • Particle degeneracy and impoverishment remain risks, particularly in high-dimensional settings.
  • Choice of robustness tuning parameters (e.g., degrees of freedom in Student-t) typically requires domain knowledge or cross-validation.

Frequently asked

How does Robust SMC differ from standard Sequential Monte Carlo?

Standard SMC uses the assumed (often Gaussian) observation likelihood to weight particles. When an outlier arrives, Gaussian likelihoods assign it near-zero probability, causing weight collapse to a single particle. Robust SMC replaces the Gaussian likelihood with a heavier-tailed alternative (e.g., Student-t) or mixes it with an outlier component, so extreme observations still receive positive weight and the particle cloud remains diverse.

What is particle degeneracy and how does resampling address it?

Particle degeneracy occurs when, after a weighting step, all of the importance weight concentrates on one or a few particles. Resampling draws a new set of N particles by sampling with replacement proportional to the weights, discarding low-weight particles and duplicating high-weight ones. This restores diversity but introduces sampling variance, so adaptive resampling (triggered only when effective sample size falls below a threshold) is preferred.

When should I use a Student-t likelihood instead of Gaussian?

Use a Student-t likelihood when you suspect the observation noise has heavier tails than Gaussian — for example, financial returns, radar clutter, or ecological count data with overdispersion. The degrees-of-freedom parameter controls tail weight; values between 3 and 10 are common. A prior sensitivity analysis over this parameter is advisable.

Can Robust SMC handle high-dimensional state spaces?

Poorly: particle filters in general suffer from the curse of dimensionality. Above roughly 10-20 state dimensions, an astronomically large number of particles is needed for adequate coverage. In high-dimensional settings, Rao-Blackwellisation, auxiliary particle filters, or hybrid approaches combining SMC with Kalman-type updates are preferred.

Is Robust SMC the same as a robust Kalman filter?

No. A robust Kalman filter is a linearisation-based method that modifies the Kalman update equations to downweight outliers while retaining the Gaussian, linear-conjugate structure. Robust SMC makes no linearity or Gaussianity assumption and can handle fully nonlinear, non-Gaussian models, at the cost of higher computational expense.

Sources

  1. Ristic, B., Arulampalam, S., & Gordon, N. (2004). Beyond the Kalman Filter: Particle Filters for Tracking Applications. Artech House. ISBN: 978-1580536318
  2. Akyildiz, O. D., & Miguez, J. (2020). Nudging the particle filter. Statistics and Computing, 30(2), 315-336. DOI: 10.1007/s11222-019-09884-y ↗

How to cite this page

ScholarGate. (2026, June 3). Robust Sequential Monte Carlo Methods. ScholarGate. https://scholargate.app/en/bayesian/robust-sequential-monte-carlo

Related methods

Hamiltonian Monte CarloKalman FilterParticle FilterRobust Bayesian InferenceRobust Kalman FilterSequential Monte Carlo

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.

  • Hamiltonian Monte CarloBayesian↔ compare
  • Kalman FilterBayesian↔ compare
  • Particle FilterBayesian↔ compare
  • Robust Bayesian InferenceBayesian↔ compare
  • Robust Kalman FilterBayesian↔ compare
  • Sequential Monte CarloBayesian↔ compare
Compare side by side →

Referenced by

Robust Particle Filter

Similar methods

Robust Particle FilterSequential Monte CarloSequential Monte Carlo with Measurement ErrorTime series sequential Monte CarloDynamic Sequential Monte CarloTime series particle filterSequential Monte Carlo with Missing DataParticle Filter with Measurement Error

Related reference concepts

Importance SamplingHidden Markov ModelsBayesian Computation and MCMCHamiltonian Monte CarloEM AlgorithmStochastic Optimization

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Robust Sequential Monte Carlo (Robust Sequential Monte Carlo Methods). Retrieved 2026-07-21 from https://scholargate.app/en/bayesian/robust-sequential-monte-carlo · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Ristic, Arulampalam, Gordon and others (2000s, with ongoing development)
Year
2000s
Type
Sequential Bayesian sampling algorithm
DataType
Sequential / time-series data, potentially containing outliers
Subfamily
Bayesian / computational
Related methods
Hamiltonian Monte CarloKalman FilterParticle FilterRobust Bayesian InferenceRobust Kalman FilterSequential Monte Carlo
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account