Universal Learning of Nonlinear Dynamics
Reviewed by Pithpith:JNFHQWM6open to challenge →
read the original abstract
We study the fundamental problem of learning a marginally stable unknown nonlinear dynamical system. We describe an algorithm for this problem, based on the technique of spectral filtering, which learns a mapping from past observations to the next based on a spectral representation of the system. Using techniques from online convex optimization, we prove vanishing prediction error for any nonlinear dynamical system that has finitely many marginally stable modes, with rates governed by a novel quantitative control-theoretic notion of learnability. The main technical component of our method is a new spectral filtering algorithm for linear dynamical systems, which incorporates past observations and applies to general noisy and marginally stable systems. This significantly generalizes the original spectral filtering algorithm to both asymmetric dynamics as well as incorporating noise correction, and is of independent interest.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Two-Layer Linear Auto-Regressive Models Estimate Latent States
Two-layer linear auto-regressive models recover Kalman filter state estimates up to similarity transformation when trained on data from partially observed linear dynamical systems.
-
The Power of Second Order Methods for Sequence Preconditioning
USP paired with VAW delivers O(log^3 T) regret for marginally stable linear dynamical systems with asymmetric hidden matrices.
-
The Power of Second Order Methods for Sequence Preconditioning
VAW on short ARX models with USP and Faber polynomials achieves O(δ^{-4} log² T) regret for marginally stable LDS with spectral wedge δ.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.