Skip to content
Open access

Stability-Regularized Residual Neural ODEs: From Rollout-Error Contraction Diagnostics to a Train-Time Method for Robust Long-Horizon Forecasting

Aug 2026 · Mathematics · Vol 14, pp. 2850 · 0 citations · 16 references

TL;DR

This work augments the one-step objective with a contraction penalty λEx[(μ2(Jf^(x))−c)+], and studies when this improves robust forecasting across stable, expansive, marginal, and chaotic regimes under realistic sensor-corruption noise.

Abstract

Residual neural ordinary differential equations (NODEs) of the form f^=f+hθ can attain small one-step prediction error yet diverge under autonomous long-horizon rollout. A recent diagnostic attributes this to the one-sided Lipschitz (OSL) constant—the supremum over visited states of the logarithmic norm μ2(Jf^)=λmax(12(Jf^+Jf^⊤))—which, when positive, signals local expansion and amplifies persistent approximation error. In this work we convert this post hoc diagnostic into a train-time method by augmenting the one-step objective with a contraction penalty λEx[(μ2(Jf^(x))−c)+], and we study when this improves robust forecasting across stable, expansive, marginal, and chaotic regimes under realistic sensor-corruption noise. We prove that, at the penalty’s minimizer, the empirical OSL constant is controlled on the training set. A sample-to-domain covering condition then yields, via a Gronwall-type comparison, a conditional uniform-in-time rollout-error bound, with a time-averaged variant that justifies penalizing the mean rather than the maximum log-norm. Empirically, on a six-system, four-noise benchmark the penalty reliably drives the OSL constant down by one-to-two orders of magnitude, but whether this helps long-horizon accuracy is strongly regime-dependent and λ-sensitive: a common default (λ=0.1) over-damps and degrades rollout, whereas a calibrated λ≈0.01 helps only for measurably expansive baselines. Under a seed-decoupled re-evaluation with 15 seeds, the benefit is robust on a near-unstable, rotation-dominated oscillator—a 2.3× lower 100-step rollout error (p=0.018) at matched one-step error—but the apparent 5-seed improvement on a six-dimensional chemical reaction network does not replicate: with model and dataset seeds decoupled it reverses to a significant degradation, identifying the original effect as a seed-coupling artifact. The method thus yields a single robust positive result, and degrades already-contractive, conservative, and chaotic systems; for chaotic systems this is unavoidable, because enforced contraction suppresses the positive Lyapunov exponents that define the attractor. Finally, while a contraction-aware spectral penalty matches the log-norm penalty, standard ∥J∥2≤1 spectral normalization fails on rotation-dominated dynamics (8× worse rollout, p=0.0005, 15 seeds), confirming that the rotation-invariance of μ2 is the operative property.

Read PDF

Similar papers

Preprint Aug 2026

Symbolic Neural ODEs: Learning interpretable models from time-series data

Multi-step training of sparse, interpretable models of dynamical systems directly from time-series data yields models with accurate short-term dynamics and strong agreement in long-time statistical properties, including mean, variance, and Lyapunov exponents.

N. Boddupalli, J. Moehlis · 0 citations
Preprint Aug 2026

Differential-Embedding Reconstruction of Dynamical Systems from Scalar Time Series

We study the reconstruction of an unknown dynamical system from a single noisy scalar time series. The goal is to recover the underlying dynamics for forecasting. We introduce a method that uses differential embedding coordinates to identify a rational closure of the embedding dynamics directly from data. The closure i...

A. Shaa, C. Guet · 0 citations
#machine learning Preprint Sep 2026

Neural ODEs Meet Concurrent Learning: Stable Online Learning with Lyapunov Guarantees

Neural ODEs learn dynamics from trajectory losses, but their adjoint gradients lack the regressor-times-parameter-error structure on which Lyapunov analyses of online adaptation rest, so training on streaming data comes without stability guarantees. We show that this structure is in fact present: the adjoint gradient d...

O. Patil · 0 citations
Preprint Aug 2026

Long-Time Trajectory Approximation via SA-NODEs: Model Predictive and Floquet Strategies

We study the approximation of dynamical systems by semi-autonomous neural ordinary differential equations (SA-NODEs) over long time horizons. For a single network trained on the whole horizon, the available error bound deteriorates double exponentially in the horizon length. We develop two training strategies that avoi...

Zi-Qian Li, Nikolaos M. Matzakos · 0 citations
Open access Sep 2026

Physics-Informed and Data-Driven Forecasting of Chaotic Dynamics Across Lorenz and Rössler Systems

Reliable finite-horizon forecasting of chaotic dynamics is challenging because small approximation errors grow rapidly during recursive prediction. This study presents a controlled comparison of data-driven and physics-regularized forecasting methods for the Lorenz and Rössler systems. The proposed Hybrid Physics-Infor...

Abdul Karim, M. Carratù, In Cheol Jeong · 0 citations
Sep 2026

Revisiting Dynamical System-Based Financial Forecasting: The Role of Smoothing Methods

This study examines the role of causal smoothing in dynamical system-based financial forecasting by integrating an asymmetric backward Savitzky-Golay (SG) filter into the new Price Reversion Model (nPRM) and comparing it with conventional moving-average preprocessing on the S&P 500 index. Despite the theoretical advant...

Tsung-Jui-Chiang Lin, Yong-Shiuan Lee, T. Shieh · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.