Pith. sign in

REVIEW 2 cited by

Out-of-Domain Generalization in Dynamical Systems Reconstruction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.18377 v2 pith:DIX5HOQQ submitted 2024-02-28 cs.LG cs.AImath.DSnlin.CD

classification cs.LGcs.AImath.DSnlin.CD
keywords dynamicaloodggeneralizationsystemsgeneralizelearningmathematicalmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Extrapolating the emergence of Hamiltonian chaos with random-feature Hamiltonian neural networks

    nlin.CD 2026-07 conditional novelty 7.0 of 10

    A random-feature Hamiltonian neural network trained only on regular dynamics extrapolates the onset and growth of chaos in four Hamiltonian systems.

  2. KPFlow: An Operator Perspective on Dynamic Collapse Under Gradient Descent Training of Recurrent Networks

    cs.LG 2025-07 conditional novelty 6.0 of 10

    The gradient flow of recurrent networks can be written as -P K P* Err, and the low rank of K explains dynamic collapse to low-dimensional attractors.

Pith tools