2000 character limit reached
Interpretable Gradient Descent for Kalman Gain
Published 18 Jul 2025 in math.OC, cs.SY, and eess.SY | (2507.14354v1)
Abstract: We derive a decomposition for the gradient of the innovation loss with respect to the filter gain in a linear time-invariant system, decomposing as a product of an observability Gramian and a term quantifying the ``non-orthogonality" between the estimation error and the innovation. We leverage this decomposition to give a convergence proof of gradient descent to the optimal Kalman gain, specifically identifying how recovery of the Kalman gain depends on a non-standard observability condition, and obtaining an interpretable geometric convergence rate.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.