SVD-based Kalman Filter Derivative Computation
Julia V. Tsyganova, Maria V. Kulikova

TL;DR
This paper introduces an SVD-based method for computing derivatives in Kalman filters, improving numerical stability and estimation accuracy in ill-conditioned scenarios compared to traditional approaches.
Contribution
The paper develops a novel SVD-based approach for Kalman filter sensitivity computation, enhancing robustness and accuracy over existing SR- and UD-based methods.
Findings
Outperforms SR- and UD-based methods in ill-conditioned cases
Provides algebraically equivalent but more stable derivative calculations
Numerical experiments confirm improved estimation accuracy
Abstract
Recursive adaptive filtering methods are often used for solving the problem of simultaneous state and parameters estimation arising in many areas of research. The gradient-based schemes for adaptive Kalman filtering (KF) require the corresponding filter sensitivity computations. The standard approach is based on the direct differentiation of the KF equations. The shortcoming of this strategy is a numerical instability of the conventional KF (and its derivatives) with respect to roundoff errors. For decades, special attention has been paid in the KF community for designing efficient filter implementations that improve robustness of the estimator against roundoff. The most popular and beneficial techniques are found in the class of square-root (SR) or UD factorization-based methods. They imply the Cholesky decomposition of the corresponding error covariance matrix. Another important…
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.
