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

• URL: http://arxiv.org/abs/2608.16084v1
• Date: Mon, 17 Aug 2026 04:30:03 GMT
• Title: Eigenanalysis framework for autoregressive neural emulators of multi-scale chaotic dynamics
• Abstract summary: We develop an eigenanalysis framework that reveals the dynamical origin of error growth.<n>We show how inference-time error growth is governed by its spectral radius.<n>Our results establish a theoretical foundation for the design and evaluation of neural emulators of chaotic multi-scale dynamics.
• Score: 37.134314242843914
• License: http://creativecommons.org/licenses/by/4.0/
• 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. Here, we develop an eigenanalysis framework that reveals the dynamical origin of this error growth. By analyzing the Jacobian of the learned one-step update map with respect to the state, we show how inference-time error growth, and thus model stability, is governed by its spectral radius. Direct-step architectures (models that predict the next state from the previous one) generically admit unstable eigenvalues with magnitudes exceeding one, explaining the rapid divergence of these widely used models. In contrast, integration-constrained models (where the time derivative is estimated and integrated with a higher-order integrator) collapse their eigenspectrum onto the unit circle, yielding neutral stability and a universal linear error-scaling law. The largest eigenvalue of this Jacobian provides an architecture-agnostic, a priori diagnostic of short-term skill, long-term stability, and spectral bias, without requiring an expensive rollout. Leveraging this theory, we introduce a stability-promoting loss that explicitly regularizes Jacobian-driven error amplification, improving both forecast accuracy and dynamical robustness. Demonstrated across $29$ models spanning two architectures, several explicit and implicit integrators, and multiple loss functions on the Kuramoto-Sivashinsky system, our results establish a theoretical foundation for the design and evaluation of neural emulators of chaotic multi-scale dynamics. More broadly, our framework is a step toward the kind of a priori stability analysis that numerical analysis provides for discretizations of differential equations and that scientific machine learning currently lacks.

Related papers

• Symbolic Neural ODEs: Learning interpretable models from time-series data [0.0]
  We present a machine learning framework for identifying sparse, interpretable models of dynamical systems from time-series data.<n>Our approach parameterizes the underlying vector field using a neural architecture and trains it by minimizing a multi-step prediction loss over a finite horizon.<n>We show that multi-step training yields models with accurate short-term dynamics and strong agreement in long-time statistical properties.
  arXiv  Detail & Related papers  (2026-08-22T21:31:07Z)
• A Quadratic Order Reduction -- Gaussian Process Ordinary Differential Equation framework for the inference of Large Continuous Dynamical Systems [0.0]
  We propose a framework for forecasting complex dynamical systems via a kernel autonomous ordinary differential equation approach.<n>We integrate it with quadratic order reduced-order modelling and sphere projection for learning the latent dynamics efficiently while preserving stability.<n>Results demonstrate the potential of the framework as a robust and stable tool for forecasting complex dynamical systems with rigorous uncertainty quantification.
  arXiv  Detail & Related papers  (2026-06-11T08:49:18Z)
• A comparative study of accuracy and rollout stability of temporal surrogate models [0.0]
  Temporal surrogate models are effective for predicting chaotic dynamical systems where computational cost can be prohibitive.<n>In this work, a few commonly used architectures are compared using a common training protocol.<n>Experiments are carried out for three problems, the double pendulum, the Kuramoto-Sivashinsky equations, and the Kolmogorov flow.
  arXiv  Detail & Related papers  (2026-05-24T04:59:04Z)
• Yield Curves Dynamics Using Variational Autoencoders Under No-arbitrage [0.0]
  This paper introduces a physics-informed framework that resolves the conflict between the statistical flexibility of deep learning and the rigorous theoretical constraints of fixed-income modeling.<n>We demonstrate that standard generative models and unconstrained statistical extrapolations suffer from "manifold collapse" and severe arbitrage violations when forecasting term structures across diverse macroeconomic regimes.<n>Ultimately, this research provides a highly scalable, mathematically sound evolutionary engine for term structure modeling.
  arXiv  Detail & Related papers  (2026-05-12T21:21:25Z)
• PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting [62.22445401483844]
  Existing methods are severely constrained by the bottleneck of compounding errors.<n>We propose a universal framework called -Cast-Corrector (Plug-and-Play Corrector)<n>Our method significantly enhances the long-term stability of coupled forecasting systems.
  arXiv  Detail & Related papers  (2026-05-09T13:12:33Z)
• Robust Learning of Heterogeneous Dynamic Systems [3.5271214584237427]
  We propose a novel distributionally robust learning approach for modeling heterogeneous ODE systems.<n>We show the resulting estimator admits an explicit weighted average representation, where the weights are obtained from a quadratic optimization.<n>We establish rigorous theoretical guarantees for the proposed method, including consistency of the stabilized weights, error bound for robust trajectory estimation, and robustness validity of pointwise confidence interval.
  arXiv  Detail & Related papers  (2026-04-07T00:40:55Z)
• KoopGen: Koopman Generator Networks for Representing and Predicting Dynamical Systems with Continuous Spectra [65.11254608352982]
  We introduce a generator-based neural Koopman framework that models dynamics through a structured, state-dependent representation of Koopman generators.<n>By exploiting the intrinsic Cartesian decomposition into skew-adjoint and self-adjoint components, KoopGen separates conservative transport from irreversible dissipation.
  arXiv  Detail & Related papers  (2026-02-15T06:32:23Z)
• The Procrustean Bed of Time Series: The Optimization Bias of Point-wise Loss [53.542743390809356]
  This paper aims to provide a first-principles analysis of the Expectation of Optimization Bias (EOB)<n>Our analysis reveals a fundamental paradigm paradox: the more deterministic and structured the time series, the more severe the bias by point-wise loss function.<n>We present a concrete solution that simultaneously achieves both principles via DFT or DWT.
  arXiv  Detail & Related papers  (2025-12-21T06:08:22Z)
• Implicit Neural Differential Model for Spatiotemporal Dynamics [5.1854032131971195]
  We introduce Im-PiNDiff, a novel implicit physics-integrated neural differentiable solver for stabletemporal dynamics.<n>Inspired by deep equilibrium models, Im-PiNDiff advances the state using implicit fixed-point layers, enabling robust long-term simulation.<n>Im-PiNDiff achieves superior predictive performance, enhanced numerical stability, and substantial reductions in memory and cost.
  arXiv  Detail & Related papers  (2025-04-03T04:07:18Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.