Pith. sign in

REVIEW 1 cited by

Multi-Task System Identification of Similar 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 2301.01430 v3 pith:C5W55UTW submitted 2023-01-04 eess.SY cs.SYmath.OC

classification eess.SYcs.SYmath.OC
keywords systemssimilaridentificationmethodproposedsystemconnectivitydynamics
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a system identification framework -- inspired by multi-task learning -- to estimate the dynamics of a given number of linear time-invariant (LTI) systems jointly by leveraging structural similarities across the systems. In particular, we consider LTI systems that model networked systems with similar connectivity, or LTI systems with small differences in their matrices. The system identification task involves the minimization of the least-squares (LS) fit for individual systems, augmented with a regularization function that enforces structural similarities. The proposed method is particularly suitable for cases when the recorded trajectories for one or more LTI systems are not sufficiently rich, leading to ill-conditioning of LS methods. We analyze the performance of the proposed method when the matrices of the LTI systems feature a common sparsity pattern (i.e., similar connectivity), and provide simulations based on real data for the estimation of the brain dynamics. We show that the proposed method requires a significantly smaller number of fMRI scans to achieve similar error levels of the LS.

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