Pith. sign in

REVIEW 2 cited by

A New Approach to Learning Linear Dynamical Systems

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 2301.09519 v1 pith:FSM7P42G submitted 2023-01-23 math.OC cs.DScs.LGstat.ML

classification math.OCcs.DScs.LGstat.ML
keywords lineardynamicalsystemdynamicslearningpolynomialalgorithmassumptions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Linear dynamical systems are the foundational statistical model upon which control theory is built. Both the celebrated Kalman filter and the linear quadratic regulator require knowledge of the system dynamics to provide analytic guarantees. Naturally, learning the dynamics of a linear dynamical system from linear measurements has been intensively studied since Rudolph Kalman's pioneering work in the 1960's. Towards these ends, we provide the first polynomial time algorithm for learning a linear dynamical system from a polynomial length trajectory up to polynomial error in the system parameters under essentially minimal assumptions: observability, controllability, and marginal stability. Our algorithm is built on a method of moments estimator to directly estimate Markov parameters from which the dynamics can be extracted. Furthermore, we provide statistical lower bounds when our observability and controllability assumptions are violated.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Learning clusters of partially observed linear dynamical systems

    eess.SY 2025-07 conditional novelty 6.0 of 10

    A clustering-then-refinement algorithm learns clusters of linear systems from many short trajectories, with a 1/sqrt(NT) error trade-off and finite-sample guarantees.

  2. Canonical Bayesian Linear System Identification

    stat.ML 2025-07 conditional novelty 6.0 of 10

    Bayesian inference for LTI systems in canonical state-space forms resolves parameter non-identifiability, yields well-behaved posteriors, and restores Bernstein-von Mises asymptotics.

Pith tools