The paper introduces kernel-based methods for learning Hamiltonian systems directly from trajectory data, offering both a 2‑step approach (reconstruct trajectories first, then learn the Hamiltonian) and a 1‑step approach (joint inference). Experiments on mass‑spring dynamics, a nonlinear pendulum, and the Henon‑Heiles system show that the methods achieve accurate, data‑efficient predictions, outperforming 2‑step baselines especially when data are scarce, while preserving the Hamiltonian structure. The authors also provide a priori error estimates and a general numerical framework applicable to arbitrary dynamical systems.
By Yasamin Jalalian, Mostafa Samir, Boumediene Hamzi, Peyman Tavallali, Houman Owhadi
arXiv:2605. 14982v2 Announce Type: replace-cross Abstract: We address the discounted reward setting in reinforcement learning (RL).
By Sanjeev Manivannan, Shuban V
arXiv:2608.30431v1 Announce Type: cross
Abstract: By focusing on algorithmic stability as a means of establishing out-of-sample bounds, we provide a system-theoretic interpretation of generalization...
By Filippo Fabiani
arXiv:2509. 19869v2 Announce Type: replace-cross Abstract: Data-driven control increasingly relies on deep models for complex systems whose first-principles models are difficult to obtain.
By Teruki Kato, Ryotaro Shima, Kenji Kashima
arXiv:2607. 22004v1 Announce Type: new Abstract: Energy natural gradient descent (ENGD) aligns parameter updates with the curvature of an underlying function-space energy, but existing formulations assume an unconstrained Euclidean parameter domain.
By Zhangyong Liang, Huanhuan Gao
The paper presents a finite‑sample learning‑to‑control framework for geometrically supervised latent models of nonlinear deterministic systems. It introduces an encoder‑only local–global metric hinge that ensures directional resolution and state discrimination, and proves that any approximate empirical minimizer is pointwise co‑Lipschitz and uniformly approximately semiconjugate to the true dynamics under regularity assumptions. The results provide explicit bounds on approximation, sampling, and optimization errors, and demonstrate through controlled experiments that restoring metric resolution improves control performance.
By Alain Bensoussan, Minh-Nhat Phung, Minh-Binh Tran
arXiv:2508. 01718v2 Announce Type: replace Abstract: We develop a physics-informed policy-iteration method for stationary second-order Hamilton--Jacobi--Bellman equations arising in continuous-time stochastic control.
By Yeongjong Kim, Minseok Kim, Yeoneung Kim, Namkyeong Cho
arXiv:2607. 16177v1 Announce Type: new Abstract: Reinforcement learning (RL) has recently emerged as a promising feedback control strategy for nonlinear and complex dynamical systems.
By Matteo Tomasetto, Nicol\`o Botteghi, Gabriele Bruni, Andrea Manzoni
arXiv:2607. 28036v1 Announce Type: new Abstract: It is well known that Newton's method converges faster when the initial guess is closer to a root of a system of nonlinear equations.
By R\'emy Vallot (CB, Michelin), Florian de Vuyst (BMBI), Thibault Dairay (CB, Michelin), Mathilde Mougeot (CB, ENSIIE, ENS Paris Saclay)
The paper introduces a structured method for learning linear operators in control systems using data. It leverages the framework of (semi)groups for evolution equations to establish structural assumptions and applies inverse‑problems theory to analyze learning algorithms, revealing error decompositions, convergence guarantees, and optimal regularization. Focusing on bounded operators on Hilbert spaces, the authors derive a convergent estimator for time‑varying systems, illustrating the practical power of their approach.
By Max Beier, Nicolas Hoischen, Sandra Hirche, Petar Bevanda
arXiv:2606. 24999v1 Announce Type: new Abstract: High-dimensional partial differential equations (PDEs) with unknown coefficients arise widely in scientific machine learning, including continuous-time reinforcement learning, yet solving them efficiently in a data-driven way remains challenging.
By Yanwei Jia, Du Ouyang, Huy\^en Pham, Xun Yu Zhou
The paper investigates continuous‑time stochastic control problems with unknown drift and running reward functions, using an exploratory reinforcement learning framework that incorporates relaxed controls and entropy regularization. It develops policy‑iteration algorithms based on probabilistic representations of the optimal value function and its gradient, proving convergence and demonstrating performance through numerical examples. The study also extends to a special case with control‑dependent diffusion, requiring a Hessian representation.
By Jin Ma, Gaozhan Wang, Jianfeng Zhang, Xunyu Zhou