- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper introduces a parametric neural Lyapunov framework that verifies system stability across a continuous range of disturbance magnitudes. The method leverages the residual's affine dependence on these magnitudes to reuse cached bounds and a shared branch-and-bound partition, which significantly accelerates verification problems. Additionally, it computes certified upper and lower bounds for the Lyapunov threshold throughout the target interval. Evaluations on multiple dynamical systems and neural controllers show that this approach yields computational savings over verifying independently.
Critical strengths
-
The paper extends conventional fixed-disturbance verification to a continuous range of disturbance magnitudes, which provides certified upper and lower bounds on the Lyapunov threshold throughout that range. This would be a novel and useful formulation for neural Lyapunov verification.
-
The experiments include different dynamical systems and previously released neural controllers, with comparisons against independent verification and optimized CROWN baselines.
Critical weaknesses
-
The proposed parametric bound records and shared-partition algorithm build on established techniques in incremental verification and proof reuse. While the continuous threshold enclosure is an useful extension/formulation, the paper does not sufficiently establish what is technically novel compared with existing approaches.
-
The shared and independent CROWN approaches produce identical verification outcomes. Additional successful verification results are observed only with the weaker interval-bound backend. Furthermore, the primary benefit is reduced verification time across repeated specifications. Since neural Lyapunov verification is typically performed offline, the practical significance of these savings is not justified (e.g., verification runtime does not really matter), especially when CROWN (tighter bounds) does not certify additional specifications.
-
The experiments primarily consider low-dimensional systems and controllers from existing work (ICML 2024 and NeurIPS 2025). Recent verification work are missing from the evaluation, e.g., Clip-and-Verify (NeurIPS 2025), which also evaluates challenging Lyapunov stability properties on CartPole and Quadrotor benchmarks.
-
The proposed method relies on the verification residual being affine in the disturbance magnitude, e.g., W(omega)=omega W_1. This does not generally hold when parameters affect the system dynamics or when disturbance sets are not proportionally scaled.
Questions for authors
-
Q1: Can the approach be extended to nonlinear dependence on the disturbance magnitude? How would it extend to multiple disturbance magnitudes?
-
Q2: Is the assumption V(x) > x^\top Px essential to the verification framework, or only needed to translate certified Lyapunov levels into state-space bounds?
-
Q3: Can the shared partition be reused when the upper level c_max changes, or is a fixed c_max essential to the approach?