Pith. sign in

REVIEW 1 cited by

Learning Dynamical Systems by Leveraging Data from Similar 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 2302.04344 v3 pith:ZV7FMFJK submitted 2023-02-08 stat.ML cs.LGcs.SYeess.SY

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

We consider the problem of learning the dynamics of a linear system when one has access to data generated by an auxiliary system that shares similar (but not identical) dynamics, in addition to data from the true system. We use a weighted least squares approach, and provide finite sample error bounds of the learned model as a function of the number of samples and various system parameters from the two systems as well as the weight assigned to the auxiliary data. We show that the auxiliary data can help to reduce the intrinsic system identification error due to noise, at the price of adding a portion of error that is due to the differences between the two system models. We further provide a data-dependent bound that is computable when some prior knowledge about the systems, such as upper bounds on noise levels and model difference, is available. This bound can also be used to determine the weight that should be assigned to the auxiliary data during the model training stage.

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