mlsanityData to 7 Oct 2026

The Fragility of Noise Estimation in Kalman Filter: Optimization Can Handle Model-Misspecification

arXiv 2104.02372 ↗First posted 6 Apr 2021cs.LG cs.SY eess.SYcited by 3

Not on the map. Why?

Abstract (arXiv)

The Kalman Filter (KF) parameters are traditionally determined by noise estimation, since under the KF assumptions, the state prediction errors are minimized when the parameters correspond to the noise covariance. However, noise estimation remains the gold-standard regardless of the assumptions - even when it is not equivalent to errors minimization. We demonstrate that even seemingly simple problems may include multiple assumptions violations - which are sometimes hard to even notice. We show theoretically and empirically that even a minor violation may largely shift the optimal parameters. We propose a gradient-based method along with the Cholesky parameterization to explicitly optimize the state prediction errors. We show consistent improvement over noise estimation in tens of experiments in 3 different domains. Finally, we demonstrate that optimization makes the KF competitive with an LSTM model - even in non linear problems.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 65 references that are in the map. First posted on arXiv 6 Apr 2021.

Builds on

18 of 65 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2017Simple Online and Realtime Tracking with a Deep Association Metriccited by 908
  5. 2016Simple Online and Realtime Trackingcited by 862
  6. 2017Deep Reinforcement Learning that Matterscited by 727
  7. 2017Exploring Generalization in Deep Learningcited by 595
  8. 2020MOT20: A benchmark for multi object tracking in crowded scenescited by 355
  9. 2020Implementation Matters in Deep Policy Gradients: A Case Study on PPO and TRPOcited by 184
  10. 2020What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Studycited by 157
  11. 2019Convergence rates for the stochastic gradient descent method for non-convex objective functionscited by 66
  12. 2017Long Short-Term Memory Kalman Filters:Recurrent Neural Estimators for Pose Regularizationcited by 36
6 more
  1. 2021A systematic literature review on state-of-the-art deep learning methods for process predictioncited by 32
  2. 2020Online Learning of the Kalman Filter with Logarithmic Regretcited by 21
  3. 2017Adaptive Adjustment of Noise Covariance in Kalman Filter for Dynamic State Estimationcited by 17
  4. 2019Fitting a Kalman Smoother to Datacited by 9
  5. 2021Adam revisited: a weighted past gradients perspectivecited by 9
  6. 2019DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Cluttercited by 5

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.