Learning an Outlier-Robust Kalman Filter

Authors:
Jo-Anne Ting;Evangelos Theodorou;Stefan Schaal
Affiliations:
University of Southern California, Los Angeles, CA 90089,;University of Southern California, Los Angeles, CA 90089,;University of Southern California, Los Angeles, CA 90089, and ATR Computational Neuroscience Laboratories, Kyoto, Japan
Venue:
ECML '07 Proceedings of the 18th European conference on Machine Learning
Year:
2007

Citing 2
Cited 1

A view of the EM algorithm that justifies incremental, sparse, and other variants

Learning in graphical models
Bayesian regression with input noise for high dimensional data

ICML '06 Proceedings of the 23rd international conference on Machine learning

Robust multivariate autoregression for anomaly detection in dynamic product ratings

Proceedings of the 23rd international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a modified Kalman filter that performs robust, real-time outlier detection, without the need for manual parameter tuning by the user. Systems that rely on high quality sensory data (for instance, robotic systems) can be sensitive to data containing outliers. The standard Kalman filter is not robust to outliers, and other variations of the Kalman filter have been proposed to overcome this issue. However, these methods may require manual parameter tuning, use of heuristics or complicated parameter estimation procedures. Our Kalman filter uses a weighted least squares-like approach by introducing weights for each data sample. A data sample with a smaller weight has a weaker contribution when estimating the current time step's state. Using an incremental variational Expectation-Maximization framework, we learn the weights and system dynamics. We evaluate our Kalman filter algorithm on data from a robotic dog.