Robust and Trend Following Student's t Kalman Smoothers
Aleksandr Y. Aravkin, James V. Burke, and Gianluigi Pillonetto

TL;DR
This paper introduces a robust Kalman smoothing framework using Student's t distribution to handle heavy-tailed noise and sudden state changes, with algorithms, convergence theory, and open-source implementation.
Contribution
It develops a unified, computationally efficient smoothing framework that handles outliers and abrupt changes, outperforming existing methods like L1-Laplace smoothers.
Findings
Robust smoothers outperform L1-Laplace in high outlier scenarios.
The framework handles nonlinear models and mixed robust/tracking problems.
Open-source implementation and convergence analysis are provided.
Abstract
We present a Kalman smoothing framework based on modeling errors using the heavy tailed Student's t distribution, along with algorithms, convergence theory, open-source general implementation, and several important applications. The computational effort per iteration grows linearly with the length of the time series, and all smoothers allow nonlinear process and measurement models. Robust smoothers form an important subclass of smoothers within this framework. These smoothers work in situations where measurements are highly contaminated by noise or include data unexplained by the forward model. Highly robust smoothers are developed by modeling measurement errors using the Student's t distribution, and outperform the recently proposed L1-Laplace smoother in extreme situations with data containing 20% or more outliers. A second special application we consider in detail allows tracking…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
