Aug 2026· arXiv.org· Vol abs/2608.10738· 0 citations· 29 references
Computer ScienceMathematics
TL;DR
This work proves a uniform-in-time orbital guarantee whose hypotheses are measured on the trained model, and proves an obstruction showing that, for an exactly periodic learned field, small one-period error and a contracting stroboscopic map cannot hold at once.
Abstract
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 avoid this barrier, each built on a reset of the state. The model predictive strategy partitions the horizon adaptively and restarts every window from observed data: when training meets a prescribed tolerance on every window, the composite model meets it uniformly in time, with a parameter budget linear in the horizon for targets with a bounded, uniformly regular reachable tube. The Floquet strategy addresses autonomous targets with a stable limit cycle and uses no data at deployment: a certified contraction of the learned return map confines the error to linear growth in the number of elapsed periods. For the time-periodic architecture we deploy, the scalar certificate degenerates; we prove instead a uniform-in-time orbital guarantee whose hypotheses are measured on the trained model, and an obstruction showing that, for an exactly periodic learned field, small one-period error and a contracting stroboscopic map cannot hold at once. Numerical experiments on four benchmarks confirm the predicted error laws and measure the hypotheses of every guarantee.
Designing real-time control for nonlinear systems to track periodic orbits can be challenging, especially for complex and coupled dynamical systems (e.g., tethered kites), where the true model parameters are hard to obtain. To address this, we propose a physics-informed Koopman learning approach that incorporates perio...
K. Pant, Vishnu Vijay, Yu-Fei Zhu et al.· 0 citations
Conventional model-based diffusion (MBD) achieves effective trajectory optimization by leveraging noise annealing. However, its high computational cost, primarily arising from repeated rollouts of the plant dynamics, has largely confined its use to offline settings. To address this limitation, this paper proposes bilin...
Bohyeong Pak, Kang-Min Lee, Sang-Hoon Kim· arXiv.org· 0 citations
We consider the open-loop optimal control of a dynamical system whose state is described by a time-dependent matrix $X(t)\in\mathbb{R}^{m\times n}$. Gradient-based optimization methods may incur substantial computational and memory costs, particularly for large-scale systems and fine temporal discretizations. To allevi...
Learning the continuous-time evolution of nonlinear dynamical systems relies on trajectory-based objectives, which require simulating the learned dynamics during training and backpropagating through the numerical scheme, at a cost that grows with the rollout horizon. We show that trajectory-based objectives degenerate...
Mechanism--AI coupled dynamical systems retain known mechanisms while learning unknown dynamics from data. We study how neural approximation, numerical integration, finite observations, and optimization jointly affect the accuracy of this learning process. For time-dependent learned terms in a fixed compact admissible...
Peng-Fei Song, Yan-Ni Xiao, Y. Lou et al.· 0 citations
This work addresses the computation of extreme values of observables along trajectories of dynamical systems over an \ks{infinite time horizon}. The setting is intrinsically global: trajectories may exhibit large transient excursions, approach their largest values only asymptotically as time tends to infinity, or escap...
Karolína Sehnalová, Milan Korda· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.