Structure- and Stability-Preserving Learning of Port-Hamiltonian Systems

• URL: http://arxiv.org/abs/2604.13297v1
• Date: Tue, 14 Apr 2026 21:02:49 GMT
• Title: Structure- and Stability-Preserving Learning of Port-Hamiltonian Systems
• Abstract summary: This paper investigates the problem of data-driven modeling of port-Hamiltonian systems while preserving their equipreserving Hamiltonian structure and stability.<n>We propose a novel neural-network-based port-Hamiltonian modeling technique that relaxes the convexity constraint commonly imposed by neural-based approximations.
• Score: 1.838884769821944
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper investigates the problem of data-driven modeling of port-Hamiltonian systems while preserving their intrinsic Hamiltonian structure and stability properties. We propose a novel neural-network-based port-Hamiltonian modeling technique that relaxes the convexity constraint commonly imposed by neural network-based Hamiltonian approximations, thereby improving the expressiveness and generalization capability of the model. By removing this restriction, the proposed approach enables the use of more general non-convex Hamiltonian representations to enhance modeling flexibility and accuracy. Furthermore, the proposed method incorporates information about stable equilibria into the learning process, allowing the learned model to preserve the stability of multiple isolated equilibria rather than being restricted to a single equilibrium as in conventional methods. Two numerical experiments are conducted to validate the effectiveness of the proposed approach and demonstrate its ability to achieve more accurate structure- and stability-preserving learning of port-Hamiltonian systems compared with a baseline method.

Related papers

• A Novel Schur-Decomposition-Based Weight Projection Method for Stable State-Space Neural-Network Architectures [1.1151457846264183]
  We introduce a novel stability-ensuring and backpropagation-compatible projection scheme based on the Schur decomposition.<n>The proposed methods dynamically project the quasi-triangular factor of the state matrix's real Schur decomposition onto its nearest stable peer.<n>Experiments on synthetic linear systems demonstrate that the method achieves accuracy and convergence rates comparable to those of state-of-the-art stable-system identification techniques.
  arXiv  Detail & Related papers  (2026-05-14T07:28:11Z)
• Controlled oscillation modeling using port-Hamiltonian neural networks [0.30586855806896035]
  We propose a second-order discrete gradient method embedded in the learning of dynamical systems with port-Hamiltonian neural networks.<n>We show how the use of this discrete gradient method outperforms the performance of a Runge-Kutta method of the same order.
  arXiv  Detail & Related papers  (2026-02-17T16:38:41Z)
• On Forgetting and Stability of Score-based Generative models [6.259598237089842]
  Understanding the stability and long-time behavior of generative models is a fundamental problem in modern machine learning.<n>This paper provides quantitative bounds on the sampling error of score-based generative models by leveraging stability and forgetting properties of the Markov chain associated with the reverse-time dynamics.
  arXiv  Detail & Related papers  (2026-01-29T15:37:50Z)
• Certified Neural Approximations of Nonlinear Dynamics [51.01318247729693]
  In safety-critical contexts, the use of neural approximations requires formal bounds on their closeness to the underlying system.<n>We propose a novel, adaptive, and parallelizable verification method based on certified first-order models.
  arXiv  Detail & Related papers  (2025-05-21T13:22:20Z)
• Optimal Control of Probabilistic Dynamics Models via Mean Hamiltonian Minimization [1.1992579325061068]
  We translate a probabilistic interpretation of the Pontryagin maximum principle to the challenge of optimal control with learned dynamics models.<n>Our framework provides a principled treatment of uncertainty by minimizing the mean Hamiltonian with respect to a posterior distribution over the system dynamics.<n>By bridging optimal control and reinforcement learning, our approach offers a principled and practical framework for controlling uncertain systems with learned dynamics.
  arXiv  Detail & Related papers  (2025-04-03T12:51:20Z)
• Linear Noise Approximation Assisted Bayesian Inference on Mechanistic Model of Partially Observed Stochastic Reaction Network [2.325005809983534]
  This paper develops an efficient Bayesian inference approach for partially observed enzymatic reaction network (SRN) An interpretable linear noise approximation (LNA) metamodel is proposed to approximate the likelihood of observations. An efficient posterior sampling approach is developed by utilizing the gradients of the derived likelihood to speed up the convergence of Markov Chain Monte Carlo.
  arXiv  Detail & Related papers  (2024-05-05T01:54:21Z)
• Distributionally Robust Model-based Reinforcement Learning with Large State Spaces [55.14361269378122]
  Three major challenges in reinforcement learning are the complex dynamical systems with large state spaces, the costly data acquisition processes, and the deviation of real-world dynamics from the training environment deployment. We study distributionally robust Markov decision processes with continuous state spaces under the widely used Kullback-Leibler, chi-square, and total variation uncertainty sets. We propose a model-based approach that utilizes Gaussian Processes and the maximum variance reduction algorithm to efficiently learn multi-output nominal transition dynamics.
  arXiv  Detail & Related papers  (2023-09-05T13:42:11Z)
• Probabilistic robust linear quadratic regulators with Gaussian processes [73.0364959221845]
  Probabilistic models such as Gaussian processes (GPs) are powerful tools to learn unknown dynamical systems from data for subsequent use in control design. We present a novel controller synthesis for linearized GP dynamics that yields robust controllers with respect to a probabilistic stability margin.
  arXiv  Detail & Related papers  (2021-05-17T08:36:18Z)
• COMBO: Conservative Offline Model-Based Policy Optimization [120.55713363569845]
  Uncertainty estimation with complex models, such as deep neural networks, can be difficult and unreliable. We develop a new model-based offline RL algorithm, COMBO, that regularizes the value function on out-of-support state-actions. We find that COMBO consistently performs as well or better as compared to prior offline model-free and model-based methods.
  arXiv  Detail & Related papers  (2021-02-16T18:50:32Z)
• Control as Hybrid Inference [62.997667081978825]
  We present an implementation of CHI which naturally mediates the balance between iterative and amortised inference. We verify the scalability of our algorithm on a continuous control benchmark, demonstrating that it outperforms strong model-free and model-based baselines.
  arXiv  Detail & Related papers  (2020-07-11T19:44:09Z)
• 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)

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.