arXiv AI

Eigenanalysis framework for autoregressive neural emulators of multi-scale chaotic dynamics

arXiv:2608. 16084v1 Announce Type: new Abstract: Neural autoregressive models have rapidly emerged as powerful emulators of high-dimensional chaotic systems, yet their long-term instability and error growth remain poorly understood, leading to ad-hoc solutions.

arXiv Machine Learning
1d ago

Learning Chaos Without Seeing Chaos: Extrapolation of Global Dynamics in Autoregressive Transformers

Autoregressive transformers trained on limited trajectories of nonlinear dynamical systems can extrapolate to unseen parameter regimes, reproducing period-doubling cascades, chaotic dynamics, and attractor structures with high fidelity. In the logistic map, the model captures successive period doublings up to period 128, achieving a scaling ratio within $5 imes10^{-4}$ of the Feigenbaum constant. The study also shows how control‑parameter information is processed via attention, shaping the closed‑loop dynamics during training.

By Yilun Liu, Yi Zhang, Ganyu Wu, Sikuan Yan, Mengyue Wang, Alois Knoll, Volker Tresp, Yunpu Ma
arXiv Machine Learning
Aug 7

Scientific Machine Learning of Chaotic Systems Learns Reduced-Order Equations for Neural Populations

arXiv:2507. 03631v4 Announce Type: replace Abstract: Extracting interpretable mathematical models from complex dynamical systems is difficult, especially for chaotic dynamics observed with noisy experimental data.

By Anthony G. Chesebro, David Hofmann, Vaibhav Dixit, Earl K. Miller, Richard H. Granger, Alan Edelman, Christopher V. Rackauckas, Lilianne R. Mujica-Parodi, Helmut H. Strey
arXiv Machine Learning
Sep 4

Time Without Timesteps: Simulating Coupled Dynamical Systems via Self-Consistency

The paper introduces a new method for simulating coupled dynamical systems that bypasses traditional time‑stepping. Instead of marching through time, each subsystem is represented by a neural surrogate that maps an entire driving trajectory and initial condition to a full output trajectory. Coupling is achieved by enforcing self‑consistency across these trajectories, turning the simulation into a fixed‑point problem over complete trajectories. Experiments on van der Pol oscillators and Hodgkin‑Huxley neuron networks show that only 4–10 Newton iterations are needed, compared to 1500 steps for a conventional integrator, and that the gradient can be computed without time recursion using GMRES. The spectral radius of the surrogate’s Jacobian predicts convergence, and the implicit gradient remains accurate even when unrolled backpropagation diverges.

By Liyu Zerihun, Mark Shinyoung Lee