REVIEW 1 cited by
Non-asymptotic Error Analysis of Subspace Identification for Deterministic 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
abstract
The subspace identification method (SIM) has been extensively employed in the identification of discrete-time multiple-input multiple-output (MIMO) linear time-invariant (LTI) systems. This paper focuses on the analysis of perturbation errors for the system matrices in state-space models and the corresponding system poles, under two unified SIMs, based on a single finite-length input/output sample trajectory. Specifically, we derive non-asymptotic upper bounds on these errors, providing a unified perspective across various SIM variants. Furthermore, we prove that SIMs become ill-conditioned for MIMO systems when the state-to-output dimensionality ratio $n/m$ is large, regardless of system parameters. Finally, numerical experiments are conducted to validate the non-asymptotic results and the ill-conditionedness of SIMs.
Forward citations
Cited by 1 Pith paper
-
Finite Sample Analysis of Subspace Identification for Stochastic Systems
Subspace identification is claimed to have O(1/sqrt N) finite-sample matrix errors, O(N^{-1/(2n)}) pole errors, and a super-polynomial sample complexity in n/m; the last claim is not proven.
Discussion (0). Continue with ORCID to comment.