REVIEW 2 cited by
Zero-shot forecasting of chaotic systems
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
abstract
Time-series forecasting is a challenging problem that traditionally requires specialized models custom-trained for the specific task at hand. Recently, inspired by the success of large language models, foundation models pre-trained on vast amounts of time-series data from diverse domains have emerged as a promising candidate for general-purpose time-series forecasting. The defining characteristic of these foundation models is their ability to perform zero-shot learning, that is, forecasting a new system from limited context data without explicit re-training or fine-tuning. Here, we evaluate whether the zero-shot learning paradigm extends to the challenging task of forecasting chaotic systems. Across 135 distinct chaotic dynamical systems and $10^8$ timepoints, we find that foundation models produce competitive forecasts compared to custom-trained models (including NBEATS, TiDE, etc.), particularly when training data is limited. Interestingly, even after point forecasts fail, large foundation models are able to preserve the geometric and statistical properties of the chaotic attractors. We attribute this success to foundation models' ability to perform in-context learning and identify context parroting as a simple mechanism used by these models to capture the long-term behavior of chaotic dynamical systems. Our results highlight the potential of foundation models as a tool for probing nonlinear and complex systems.
Forward citations
Cited by 2 Pith papers
-
Deficiency of equation-finding approach to data-driven modeling of dynamical systems
Different SINDy-style equations recovered from different flawed measurements of a chaotic system can produce statistically indistinguishable attractors and matching leading Koopman spectra.
-
Learning with Mandelbrot and Julia
Seven off-the-shelf ML classifiers predict Mandelbrot and Julia membership from the first 1 to 4 orbit iterates and beat the matched-iterate escape-threshold rule on all tested benchmarks.
Discussion (0). Continue with ORCID to comment.