- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper addresses a subtle problem in training neural lyapunov functions - that the gradients of the parametric certificate don't converge to 0 near the origin (assuming the origin is the equilibrium being certified or the desired set point of the controller). To address this issue, this work proposes a construction of neural lyapunov functions that are guaranteed to have only a single minimum at the equilibrium. The proposed construction is guaranteed to have a single minimum that corresponds with the equilibrium. Control synthesis experiments are conducted on a toy example, where the failure case (that is, RoAs are poor using standard constructions) are compared with the PolarNet, which outperforms it.
Critical strengths
- I think this paper addresses a subtle and interesting challenge in using neural networks for stability analysis and control. Using the PolarNet architecture potentially significantly improves the performance of neural lyapunov control style techniques.
- The single experiment in the main body, despite being on only a single example, showcases the clear need for a PolarNet-style construction, and shows that the PolarNet outperforms it significantly.
- The paper is generally written quite clearly, and is easy to follow.
Critical weaknesses
- I feel the experimental slate is not systematic enough, especially compared to related literature in this space. The method needs to be evaluated on several more systems, particularly with higher dimensionalitiy than what is shown here - even examples with a modest increase in dimension (such as the caltech ducted fan) would at least somewhat indicate the general applicability of this proposed machinery.
- There appears to be an error in the proof of Theorem 2. A simple counterexample: is smooth, invertible, and . Yet has two critical points (at x=1 and x=0). Perhaps the statement could be rephrased to say that only has a single minimum at ? Also, I think that Theorem 3 is quite similar to the stated result in Khalil already - perhaps it should be restated as a corollary to that result.
- I think the construction in Theorem 1 is quite similar to that given in Section 3 of "Asymptotic stability equals exponential stability, and ISS equals finite energy gain — if you twist your eyes" by Grune et al, 1999. If so, this weakens the novelty claims of this work.
Questions for authors
- It looks like when the origin is the equilibrium, one can simply use the norm of the solution map to construct the Lyapunov function. Would it not be simpler to simply learn the closed-loop solution map along with the necessary constraints, and take its (squared) norm for the Lyapunov function?
4 comments
Reviewer 1tF5, thanks for your review. Could you take a look at the authors’ response and comment on which of your concerns have or have not been resolved?
I thank the authors for their response, and I am happy to raise my score by 1.
Reviewer, thanks for your response. However, could you be more specific about which of your concerns have or have not been resolved? These are more important than the rating itself.
We thank the reviewer for the thoughtful comments and suggestions.
Q. Why not learn the closed-loop solution map and use its squared norm as the Lyapunov function?
The converse Lyapunov theorem does allow a Lyapunov function to be constructed from the closed-loop dynamics of a stable system. However, the construction is not simply the norm of the solution map. It typically requires integrating along state trajectories, which is computationally intractable. More importantly, it does not address the problem PolarNet solves. In controller synthesis, the closed-loop dynamics are being learned and are not known to be stable. The learned controller cannot easily be constrained to always produce stable dynamics with a valid, single-critical-point Lyapunov function. PolarNet enforces this property structurally.
In addition, we'd like to respond to the weaknesses mentioned but not covered in the questions:
W1. Higher-dimensional experiments.
We agree that scalability is important. We applied PolarNet to the Cart-Pole (4D) and 2D Quadrotor (6D) benchmarks of Wei et al. (2025), Sec. 5.3-5.4. All hyperparameters were unchanged, and only the Lyapunov network was replaced. Each experiment was repeated with 20 random seeds for both architectures. PolarNet's average RoA is 1.01× the baseline's on Cart-Pole and 1.10× on Quadrotor. PolarNet therefore scales at least as well as existing architectures. The gain is smaller here because spurious local minima rarely occur with the baseline on these systems (App. E).
Table: Parameter count, timing info and memory usage. Inference time reports the time of evaluating the controller with 1024 batch size for 10000 times. All experiments are conducted on the same device.
W2. Theorem 2.
Thank you for your careful examination. By "invertible" we mean that Ψ is a C∞ diffeomorphism: it is invertible, and its Jacobian is nonsingular everywhere. This matches our proof and the construction of PolarNet, in which each coupling layer has a smooth inverse (Eq. 7). The revision states this explicitly.
W3. Theorem 3.
As suggested, it is now stated as a corollary.
W4. Relationship with the work of Grune et al, (1999).
Theorem 1 does have a construction similar to what's given by Grune et al. But this does not hinder the novelty of our work. Grune et al. considered the relationship between stability notions, and showed that UGAS and UGES, ISS and finite energy gain, can be made equivalent under appropriate coordinate changes. In contrast, our main contribution is that we discovered a failure mode in existing neural Lyapunov control methods, identified its root cause as lack of certain structural constraints, and proposed a network architecture that structurally resolves this issue. Theorem 1 serves as a mathematical tool that certifies universality of PolarNet, rather than the central conclusion drawn by our work.