Adversarial dynamical systems characterize when data-driven learning succeeds or fails

Many systems resist analytical modeling, making data-driven inference of dynamics important.

Yet data-driven methods can fail to converge or generalize, leaving open a central question: When can system behavior be learned reliably from data, and when is such learning impossible?

We answer this question using adversarial dynamical systems to identify the boundary between accessible and inaccessible regimes.

In Koopman operator learning, a leading framework for representing nonlinear dynamics through linear spectral objects, we design optimal data-driven spectral algorithms with convergence and certification guarantees under conditions arising broadly in physical systems.

This yields a convergence theory for Koopman-operator approximations and resolves a longstanding open problem in Koopman spectral analysis.

Conversely, by constructing adversarial systems, we prove matching impossibility results: without these conditions, no single-sequence limiting procedure can guarantee learning, regardless of data quality.

These results sharply characterize when data-driven spectral learning can succeed and when it must fail.

We validate the framework on oscillators, chaotic fluid flows and Arctic sea ice concentration forecasting.

In the latter, we uncover hidden modes of Arctic sea ice decline, deliver long-range forecasts with geographic error bounds, and outperform state-of-the-art dynamical and deep learning models at substantially lower computational cost, enabling real-time deployment on standard CPUs.