Pith. sign in

REVIEW 1 cited by

Policy Optimization of Finite-Horizon Kalman Filter with Unknown Noise Covariance

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.15467 v2 pith:TJHMYVS7 submitted 2023-10-24 math.OC

classification math.OC
keywords gradientoptimizationpolicydescentkalmanmethodconvergencecovariance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper is on learning the Kalman gain by policy optimization method. Firstly, we reformulate the finite-horizon Kalman filter as a policy optimization problem of the dual system. Secondly, we obtain the global linear convergence of exact gradient descent method in the setting of known parameters. Thirdly, the gradient estimation and stochastic gradient descent method are proposed to solve the policy optimization problem, and further the global linear convergence and sample complexity of stochastic gradient descent are provided for the setting of unknown noise covariance matrices and known model parameters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Interpretable Gradient Descent for Kalman Gain

    math.OC 2025-07 conditional novelty 7.0 of 10

    Gradient descent on the innovation loss converges to the Kalman gain under a nonstandard observability condition, with a geometric rate tied to observability and orthogonality violation.

Pith tools