The reviewed record of science sign in
Pith

arxiv: 2309.08805 · v1 · pith:FQQVG4JG · submitted 2023-09-15 · eess.SY · cs.SY· stat.ML

Learning Linearized Models from Nonlinear Systems with Finite Data

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FQQVG4JGrecord.jsonopen to challenge →

classification eess.SY cs.SYstat.ML
keywords errordatadynamicslinearlinearizedsystemfinitealgorithm
0
0 comments X
read the original abstract

Identifying a linear system model from data has wide applications in control theory. The existing work on finite sample analysis for linear system identification typically uses data from a single system trajectory under i.i.d random inputs, and assumes that the underlying dynamics is truly linear. In contrast, we consider the problem of identifying a linearized model when the true underlying dynamics is nonlinear. We provide a multiple trajectories-based deterministic data acquisition algorithm followed by a regularized least squares algorithm, and provide a finite sample error bound on the learned linearized dynamics. Our error bound demonstrates a trade-off between the error due to nonlinearity and the error due to noise, and shows that one can learn the linearized dynamics with arbitrarily small error given sufficiently many samples. We validate our results through experiments, where we also show the potential insufficiency of linear system identification using a single trajectory with i.i.d random inputs, when nonlinearity does exist.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.