Universal Learning of Nonlinear Dynamics

ICLR 2026 Conference Submission22211 Authors

20 Sept 2025 (modified: 08 Oct 2025)ICLR 2026 Conference SubmissionEveryoneRevisionsBibTeXCC BY 4.0
Keywords: dynamical systems, online learning, spectral filtering
TL;DR: We describe a prediction algorithm (spectral filtering) for nonlinear dynamical systems, and using linearization and improper learning we are able to prove online regret bounds for the next-token prediction task.
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.
Primary Area: learning on time series and dynamical systems
Submission Number: 22211
Loading