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 Kalman Filter
Bayesian methodsBayesian / computational

Robust Kalman Filter

Also known as: RKF, heavy-tailed Kalman filter, outlier-robust Kalman filter, robust state estimation

The Robust Kalman Filter is an extension of the classical Kalman filter designed to maintain reliable state estimation when observations or process noise depart from the Gaussian assumption — particularly when data contain outliers, heavy-tailed distributions, or gross errors. By replacing or downweighting the standard least-squares update with influence-limited or M-estimation-based corrections, it prevents a single anomalous measurement from distorting the entire state estimate.

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 Kalman Filter
Extended Kalman FilterKalman FilterParticle FilterRobust Bayesian InferenceSequential Monte CarloRobust Particle FilterRobust Sequential Monte…

When to use it

Use the Robust Kalman Filter when tracking or estimating dynamic system states from time-series data that is likely contaminated by outliers, sensor malfunctions, or impulsive noise — such as GPS positioning, financial state-space models, or industrial process monitoring. It is also appropriate when the observation noise is known to be heavy-tailed rather than Gaussian. Do not apply it when the data are genuinely Gaussian and clean: the classical Kalman filter is optimal in that setting and computationally simpler. Avoid robust variants if interpretability of the weighting scheme is critical and the robustification mechanism cannot be clearly justified to stakeholders.

Strengths & limitations

Strengths
  • Maintains accurate state estimates even when a fraction of observations are outliers or gross errors.
  • Retains the recursive, computationally efficient structure of the standard Kalman filter.
  • Applicable to real-time sequential data streams without storing the full history.
  • Multiple robustification strategies (Huber, Student-t, bisquare) allow tuning the trade-off between efficiency and breakdown point.
  • Can be extended to nonlinear systems via robust extended or unscented variants.
Limitations
  • Robustification adds a tuning parameter (e.g., the Huber threshold c) that must be chosen, often heuristically.
  • In iterative reweighted or variational implementations, each time step requires internal iterations, increasing computational cost.
  • Performance degrades if the fraction of outliers exceeds the assumed breakdown point of the influence function.
  • The state-space model structure (linearity, known F, H, Q, R) is still required; model misspecification is a separate issue not addressed by robustness alone.

Frequently asked

How does the Robust Kalman Filter differ from the standard Kalman filter?

The standard Kalman filter minimises mean squared error under Gaussian noise and can be heavily distorted by even a single outlier. The robust version applies an influence function to the innovation, capping the effect of any single anomalous measurement so the state estimate stays on track through corrupted data.

What is the Huber threshold and how do I choose it?

The Huber threshold c defines the boundary between quadratic (Gaussian-like) and linear (outlier-resistant) treatment of the innovation residual. Values around 1.345 times the expected innovation standard deviation are a common default that preserves about 95% asymptotic efficiency under Gaussian data while providing robustness. Cross-validation or knowledge of the expected outlier magnitude can guide the choice.

Can the Robust Kalman Filter handle nonlinear systems?

Yes. The robustification principle can be grafted onto the Extended Kalman Filter (linearised around the current estimate) or the Unscented Kalman Filter (sigma-point propagation), yielding Robust EKF and Robust UKF variants. Particle filters offer a fully nonlinear alternative with built-in non-Gaussian noise handling.

Is a Student-t observation model the same as a robust Kalman filter?

Effectively yes: modelling the observation noise as Student-t instead of Gaussian leads to an update step equivalent to iteratively reweighted least squares with Huber-like weights. Variational Bayes implementations of the Student-t Kalman filter make this connection explicit and also estimate the degrees-of-freedom parameter from the data.

What should I check after running a robust Kalman filter?

Inspect the innovation sequence and the sequence of weights assigned to each observation. Most weights near 1 with occasional values close to 0 indicate the filter is correctly identifying and downweighting genuine outliers. Persistently low weights or diverging covariance matrices suggest model misspecification rather than mere outliers.

Sources

  1. Kalman, R. E. (1960). A new approach to linear filtering and prediction problems. Journal of Basic Engineering, 82(1), 35-45. DOI: 10.1115/1.3662552 ↗
  2. Huber, P. J. & Ronchetti, E. M. (2011). Robust Statistics (2nd ed.). Wiley. ISBN: 978-0470129906

How to cite this page

ScholarGate. (2026, June 3). Robust Kalman Filter. ScholarGate. https://scholargate.app/en/bayesian/robust-kalman-filter

Related methods

Extended Kalman FilterKalman FilterParticle FilterRobust Bayesian InferenceSequential 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.

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

Referenced by

Robust Particle FilterRobust Sequential Monte Carlo

Similar methods

Kalman Filter with Measurement ErrorKalman FilterRobust Particle FilterKalman Filter for Signal TrackingRobust Sequential Monte CarloTime Series Kalman FilterExtended Kalman FilterKalman Filter with Missing Data

Related reference concepts

Hidden Markov ModelsRobustness (Statistics)Data AssimilationEM AlgorithmGaussian Process ModelsStochastic Optimization

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

ScholarGate — Robust Kalman Filter (Robust Kalman Filter). Retrieved 2026-07-21 from https://scholargate.app/en/bayesian/robust-kalman-filter · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Derived from Kalman (1960); robust extensions developed by Masreliez, Martin, and others from the 1970s onward
Year
1977
Type
Sequential Bayesian state estimator with robustified update step
DataType
Time-series state-space observations, potentially containing outliers or heavy-tailed noise
Subfamily
Bayesian / computational
Related methods
Extended Kalman FilterKalman FilterParticle FilterRobust Bayesian InferenceSequential 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