Optimization or Architecture: How to Hack Kalman Filtering

Ido Greenberg, Netanel Yannay, Shie Mannor
2/12/2026

No confident code implementation found for this paper.

Abstract

In non-linear filtering, it is traditional to compare non-linear architectures such as neural networks to the standard linear Kalman Filter (KF). We observe that this mixes the evaluation of two separate components: the non-linear architecture, and the parameters optimization method. In particular, the non-linear model is often optimized, whereas the reference KF model is not. We argue that both should be optimized similarly, and to that end present the Optimized KF (OKF). We demonstrate that the KF may become competitive to neural models - if optimized using OKF. This implies that experimental conclusions of certain previous studies were derived from a flawed process. The advantage of OKF over the standard KF is further studied theoretically and empirically, in a variety of problems. Conveniently, OKF can replace the KF in real-world systems by merely updating the parameters.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{greenberg2026optimization,
  title  = {Optimization or Architecture: How to Hack Kalman Filtering},
  author = {Ido Greenberg and Netanel Yannay and Shie Mannor},
  year   = {2026},
  eprint = {2310.00675},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.00675},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.00675.svg)](https://codeofpaper.com/paper/2310.00675)

Discussion