Universal Learning of Nonlinear Dynamics
Evan Dogariu, Anand Brahmbhatt, Elad Hazan

TL;DR
This paper introduces a spectral filtering algorithm for learning marginally stable nonlinear dynamical systems, providing provable guarantees and extending previous methods to noisy and asymmetric systems.
Contribution
It presents a novel spectral filtering approach with theoretical guarantees for learning a broad class of nonlinear dynamical systems, including noisy and marginally stable cases.
Findings
Proves vanishing prediction error for systems with finitely many marginally stable modes
Develops a spectral filtering algorithm for linear systems that handles noise and asymmetry
Generalizes previous spectral filtering techniques to more complex dynamical systems
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…
Peer Reviews
Decision·Submitted to ICLR 2026
1. The authors provide comprehensive theoretical analysis for the proposed algorithm. 2. The algorithm design and particularly the regret analysis seem to contain significant novelty. 3. Existing works typically consider learning the output of linear systems. Extending it to nonlinear systems is a meaningful step.
1. The assumptions made in the paper are pretty strong (e.g., Assumption 3.1), which require further justifications. In particular, the bounded state and output assumption can make the claim that the regret results hold for marginally-stable system vacuous. (Please see the questions 1-3 below) 2. The proposed algorithm (Algorithm 1) may not be constructive, e.g., it is not fully clear how the input parameters can be (please see the question 3 below). 3. The regret bounds provided in Theorem 4.1
- This paper is really well-written. I actually really enjoyed the prose, and the authors do a great job describing the significance of their results and providing the reader with intuition. - The problem studied is relevant and of interest to the broader ML community
Unfortunately, there are several issues that need to be addressed. First, the paper does not conform to the ICLR style guides as the margins are too small. More importantly, I do not think the main text is very understandable, as key quantities/results are left undefined. For example: - A "Luenberger program" is repeatedly discussed, but never formally defined in the main text - The system's "robust observability constant $Q_{\star}$ is repeatedly referenced, but never defined in the main text -
1. Learning an one-step output predictor in the online learning setup is an interesting topic. 2. The spectral filtering method yields a convex approximation of the long-horizon behavior of a marginally stable LDS with relatively small set of parameters. This feature offers an efficient online least square regression for problems that require long-horizon trajectory information.
1. **Overstated Claims** The title and several statements (e.g., the first sentence of the abstract) substantially overstate the scope of the work relative to the specific technical problem it addresses. The paper is **not** about learning a full dynamical system. Instead, it treats **state estimation + one-step prediction** as a black-box problem and learns an adaptive online (time-varying) least-squares regression (LSR) model from the input–output trajectory. This is distinct from the conven
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Control Systems and Identification
