Pith. sign in

REVIEW 1 cited by

Joint Learning of Linear Time-Invariant 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 2112.10955 v6 pith:6ZI42SIX submitted 2021-12-21 stat.ML cs.LGcs.SYeess.SYmath.DS

classification stat.MLcs.LGcs.SYeess.SYmath.DS
keywords matricessystemstransitionlinearsystemestimationlearningproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear systems to estimate their transition matrices more accurately. To address this problem, the current paper investigates methods for jointly estimating the transition matrices of multiple systems. It is assumed that the transition matrices are unknown linear functions of some unknown shared basis matrices. We establish finite-time estimation error rates that fully reflect the roles of trajectory lengths, dimension, and number of systems under consideration. The presented results are fairly general and show the significant gains that can be achieved by pooling data across systems in comparison to learning each system individually. Further, they are shown to be robust against model misspecifications. To obtain the results, we develop novel techniques that are of interest for addressing similar joint-learning problems. They include tightly bounding estimation errors in terms of the eigen-structures of transition matrices, establishing sharp high probability bounds for singular values of dependent random matrices, and capturing effects of misspecified transition matrices as the systems evolve over time.

Discussion (0). Sign in 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. 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.

Pith tools