When is a System Discoverable from Data? Discovery Requires Chaos
arXiv:2511. 08860v2 Announce Type: replace-cross Abstract: The deep learning revolution has spurred a rise in advances of using AI in sciences.
arXiv:2606. 01596v1 Announce Type: cross Abstract: Learning chaotic dynamical systems from data requires more than short-term predictive accuracy: the learned model must preserve the attractor geometry and its invariant statistics.
arXiv:2511. 08860v2 Announce Type: replace-cross Abstract: The deep learning revolution has spurred a rise in advances of using AI in sciences.
arXiv:2607. 28080v1 Announce Type: cross Abstract: We extend a recently introduced Entropy-Optimal Manifold Clustering (EOMC) to allow for a joint simultaneous identification of subsets and subspaces of relevant features in nonstationary and nonlinear regression problems.
arXiv:2507. 09652v2 Announce Type: replace-cross Abstract: Low-dimensional chaotic systems such as the Lorenz-63 model are commonly used to benchmark system-agnostic methods for learning dynamics from data.
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:2505. 23863v3 Announce Type: replace-cross Abstract: Understanding chaotic dynamics is a fundamental problem across scientific disciplines, including climate science, neuroscience, and fluid dynamics, yet direct experimentation and intervention in such systems are often infeasible.
arXiv:2607. 18490v1 Announce Type: new Abstract: Symbolic discovery of governing equations from data is limited not only by algorithm design and data volume, but by the geometry of the attractor: what the long-run dynamics allow to be recovered.
arXiv:2608. 05522v1 Announce Type: cross Abstract: Estimating positive largest Lyapunov exponents from data is comparatively natural because neighboring trajectories separate, whereas stable dynamics require resolving contraction before measurement noise or finite precision erases the signal.
arXiv:2606. 23827v1 Announce Type: cross Abstract: A data-driven method is developed for approximating value functions in deterministic optimal control problems with nonlinear control-affine dynamics.
Estimating positive largest Lyapunov exponents from data is comparatively natural because neighboring trajectories separate, whereas stable dynamics require resolving contraction before measurement noise or finite precision erases the signal. We introduce a period-aware forecast-error contraction procedure for estimating a dominant negative Lyapunov exponent from ensembles of short scalar trajectories without using governing equations or an analytical Jacobian.
arXiv:2511. 06609v4 Announce Type: replace Abstract: The accurate forecasting of complex, high-dimensional dynamical systems from observational data is a fundamental task across numerous scientific and engineering disciplines.
arXiv:2606. 07385v1 Announce Type: cross Abstract: Detecting transient chaos from scalar observations without governing equations represents a fundamental challenge in nonlinear dynamics.
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.