pith. sign in

arxiv: 2402.18377 · v2 · pith:DIX5HOQQnew · submitted 2024-02-28 · 💻 cs.LG · cs.AI· math.DS· nlin.CD

Out-of-Domain Generalization in Dynamical Systems Reconstruction

classification 💻 cs.LG cs.AImath.DSnlin.CD
keywords dynamicaloodggeneralizationsystemsgeneralizelearningmathematicalmodel
0
0 comments X
read the original abstract

In science we are interested in finding the governing equations, the dynamical rules, underlying empirical phenomena. While traditionally scientific models are derived through cycles of human insight and experimentation, recently deep learning (DL) techniques have been advanced to reconstruct dynamical systems (DS) directly from time series data. State-of-the-art dynamical systems reconstruction (DSR) methods show promise in capturing invariant and long-term properties of observed DS, but their ability to generalize to unobserved domains remains an open challenge. Yet, this is a crucial property we would expect from any viable scientific theory. In this work, we provide a formal framework that addresses generalization in DSR. We explain why and how out-of-domain (OOD) generalization (OODG) in DSR profoundly differs from OODG considered elsewhere in machine learning. We introduce mathematical notions based on topological concepts and ergodic theory to formalize the idea of learnability of a DSR model. We formally prove that black-box DL techniques, without adequate structural priors, generally will not be able to learn a generalizing DSR model. We also show this empirically, considering major classes of DSR algorithms proposed so far, and illustrate where and why they fail to generalize across the whole phase space. Our study provides the first comprehensive mathematical treatment of OODG in DSR, and gives a deeper conceptual understanding of where the fundamental problems in OODG lie and how they could possibly be addressed in practice.

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.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Global Empirical NTK: Self-Referential Bias and Dimensionality of Gradient Descent Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    The global empirical NTK for finite-width networks has a universal Kronecker-core form that makes it structurally low-rank and biases gradient descent toward dominant modes of joint input-hidden activity.

  2. State-Space NTK Collapse Near Bifurcations

    cs.LG 2026-05 unverdicted novelty 6.0

    Bifurcations cause sNTK to reduce to a dominant rank-one channel matching normal forms, collapsing effective rank and funneling gradient descent into critical dynamical directions.

  3. PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting

    cs.AI 2026-05 unverdicted novelty 6.0

    PnP-Corrector decouples physics simulation from error correction to counter reciprocal error amplification in coupled spatiotemporal forecasting, cutting error by 29% in a 300-day ocean-atmosphere test.

  4. PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting

    cs.AI 2026-05 unverdicted novelty 6.0

    PnP-Corrector decouples physics simulation from error correction via a plug-and-play agent, cutting error by 29% in 300-day global ocean-atmosphere forecasts.

  5. PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting

    cs.AI 2026-05 unverdicted novelty 4.0

    PnP-Corrector decouples pre-trained physics engines from a correction agent to mitigate reciprocal error amplification in coupled spatiotemporal forecasting, cutting error by 28% on a 300-day ocean-atmosphere task.