- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces a neural architecture that combines a coercive, nonconvex modern Hopfield Hamiltonian with port-Hamiltonian neural ODEs to support safety by design while capturing complex nonlinear dynamics. The learned energy defines invariant sublevel components under admissible inputs, with robustness margins and disturbance bounds derived from the energy geometry. Experiments on demonstrate competitive predictive accuracy and improved long-horizon boundedness.
Critical strengths
-
Coercive nonconvex energies permit multiple operating regimes while retaining compact sublevel sets. This offers a meaningful extension beyond architectures organized around one convex energy well.
-
The framework gives interpretable input and disturbance margins from the same energy used for prediction. The benchmark range, including 12-state drone dynamics and long-horizon extrapolation, supports its usefulness for structured system identification.
Critical weaknesses
-
The reported robustness radii are not established continuous-state certificates. Appendix C.7 states that shell minima and geometric bounds rely on sampled extrema unless independently bounded. Such estimates can overstate the admissible radius, yet Table 1 and the main text describe them as certified, weakening the central quantitative safety claim.
-
The method establishes latent energy confinement without showing that the decoder maps the invariant region into the prescribed Y_safe, as Definition 1 requires. Continuity ensures a compact output image but does not establish safety-set containment. The constructed energy components also do not establish the maximal invariant set sought in Problem 1. These gaps concern the learned-model guarantees, independently of the acknowledged model-to-plant limitation.
Questions for authors
-
Which reported radii have rigorous continuous-boundary lower bounds, rather than ray-sampled estimates? What verification procedure establishes those bounds, and do the tested inputs lie within them?
-
What prescribed Y_safe is used in each benchmark, and how is decoder containment verified for every admissible input? Is the intended result a sufficient invariant energy component rather than a maximal invariant set?
3 comments
Further comment
Thank you for your response. But I will keep my score as it is, given the scope of the contributions.
Thank you for the follow-up.
“The scope of the contributions” does not identify a specific scientific limitation or explain which concern remains unresolved.
Our contribution unifies nonlinear dynamics learning, a coercive nonconvex Hamiltonian supporting multiple operating regimes, and quantitative input/disturbance margins guaranteeing confinement of selected energy components while achieving SOTA accuracy on selected low and high-dimensional benchmarks.
Architectural guarantees on learned dynamics are substantive contributions in closely related work [1–3]. Our framework additionally quantifies (and now certifies) robustness of nonconvex invariant components under external forcing.
[1] Roth et al. Stable Port-Hamiltonian Neural Networks. NeurIPS 2025.
[2] Okamoto and Kojima. Learning Deep Dissipative Dynamics. AAAI 2025.
[3] Beik-Mohammadi et al. Neural Contractive Dynamical Systems. ICLR 2024.
Thank you. We distinguish the architectural guarantee from the numerical estimates and answer the two certification questions directly.
Q1: Which radii are formally certified, and how?
Energy sublevels naturally confine the unforced model. Theorem 1, Equation (10), identifies the input bounds preserving a selected component under forcing. Thus, the certificate candidate comes natively with the learned dynamics. Its input radius can be estimated by sampling (ρ^) or bounded formally (ρˉ) over the complete boundary. Sampling alone, as presented in the paper, is not a continuous-state certificate.
The original table entries are now identified as empirical estimates, and we are adding a formal Duffing certificate. For the right-well energy budget E≃−0.09565, sampling suggested ρ^≃0.031. Arb interval arithmetic [1] and our verifier adapting the bound-propagation approach of Mathiesen et al. [2] both certified ρˉ=0.0264. The proof encloses the component, establishes boundary regularity and verifies
∇H(z)⊤f(z,u)≤0
for every boundary state and every admissible input. The complete proofs took about 36 and 16 minutes, respectively, on 16 workers. This is a verified lower bound, without an optimality claim. We will also try to include formal bounds for the other systems.
Why the architectural guarantee matters.
Our contribution is an architecture for learning input-driven dynamics together with an energy function defining candidate invariant regions. This complements methods that certify a given model through reachability analysis or auxiliary barrier synthesis. Whereas barrier synthesis typically learns a separate certificate and verifies its sign and dynamical conditions, our Hamiltonian already supplies the candidate, and the port-Hamiltonian structure enforces the energy balance in Equation (5).
Q2: What output-safe set is used, and is the invariant set maximal?
Our intended guarantee is an a posteriori output envelope induced by the learned energy, with no a priori prescription of Ysafe. For an energy component C invariant under all admissible K-valued inputs, define
Ysafe:=h(C,K)=h(z,u):z∈C,u∈K.
Then, for every such input,
z(0)∈C⟹z(t)∈C⟹y(t)=h(z(t),u(t))∈Ysafe∀t≥0.
Output confinement follows directly from latent invariance, including the decoder's full input dependence. No additional decoder-containment verification is needed for this induced envelope. Continuity additionally makes it compact when C and K are compact. For identity output maps, the state component itself becomes the output envelope. These guarantees concern the learned model; transfer to a physical plant requires a validated model-error bound and model–plant relation.
Our construction yields a sufficient invariant energy component and its output envelope. We have clarified Problem 1 accordingly: maximal state-space invariance is not claimed. Likewise, the computed input radius is a verified lower bound for the selected component, without establishing the largest admissible input envelope.
References
[1] F. Johansson. Arb: efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Transactions on Computers 66(8), 1281–1292 (2017).
[2] F. B. Mathiesen, S. C. Calvert and L. Laurenti. Safety Certification for Stochastic Systems via Neural Barrier Functions. IEEE Control Systems Letters 7, 973–978 (2023).