- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper presents SEVA-Lyap, a framework for discovering symbolic Lyapunov functions by combining adaptive data generation with test-time refinement. Instead of relying on a fixed training dataset, the method uses feedback from the current solver to generate increasingly challenging training examples. At test time, it further uses unsuccessful predictions through verification-guided reinforcement learning. Experiments on polynomial and non-polynomial systems show that SEVA-Lyap improves verification success from 70.75% to 92.00% and from 60.50% to 74.50%, respectively, compared with the Symbolic Transformer baseline.
Critical strengths
-
Well-motivated approach: Motivation is clear, stability is one of the fundamental problems in control theory.
-
Strong empirical results: This method improves upon previous work by a good margin.
-
Comprehensive evaluation: Authors do a great job at ablation.
Critical weaknesses
- Concerns about the verification: The most significant concern is that the SHGO verifier does not appear to enforce strict positive definiteness, which is essential for a valid Lyapunov function. Appendix A accepts candidates based on approximate nonnegativity, potentially allowing invalid solutions. For example, consider the unstable system with . Although , the candidate is not positive definite because it vanishes away from the origin. Nevertheless, it satisfies the stated acceptance conditions. The authors should clarify whether their implementation includes additional checks (that is not mentioned in the paper, I did not see one) to rule out such cases.
Alfarano et al, NeurIPS 2024 (which is cited in this paper) explicitly mentions this. See Def 2.2 and Evaluation paragraph in Section 3.
-
Fundamental problem: I do not understand how this method can be applied to real-world systems. Typically, unstable trajectories lead to disastrous consequences. I do not think it is reasonable to assume we can use such violations indefinitely.
-
Limited generalization: Most of the benchmarks are generated using procedures similar to those used during training. While the authors also test on independently generated systems, the low success rates make it difficult to tell how well the method would work on a wider range of systems.
-
Limited novelty: The method combines several existing ideas, such as adaptive data generation, policy-gradient learning, replay, and GRPO. Although these techniques work well together, it is not entirely clear what the paper adds beyond combining them.
Questions for authors
See weaknesses.
6 comments
Response to Reviewer rHen (2/4)
W2: Real-world applicability and unsafe violations
Thank you for raising this important concern. We agree that unsafe trajectories cannot be tolerated in physical systems, and we would like to provide further clarification building on our response to W1.
During adversarial data generation, the generated symbolic components are assembled into system–Lyapunov pairs using fixed validity-preserving rules. These rules ensure that the target function is strictly positive away from the origin and satisfies the Lyapunov decrease condition on the admissible domain. Thus, the nonzero-state degeneracy identified in W1 is excluded from the constructed training targets. The Solver therefore learns from valid pairs rather than from examples whose validity is relaxed to accommodate violations. As reported in W1, all 666 final accepted outputs also passed the stricter SHGO positivity threshold, and the additional dReal check found no confirmed counterexamples. These results provide no evidence that our reported performance relies on what you describe as “using such violations indefinitely.” Instead, they suggest that pretraining on valid examples can help the model learn to avoid this type of failure, while explicit verification remains part of the procedure.
Our method further supports this assessment by generating Lyapunov functions as explicit symbolic expressions. Domain experts can inspect and simplify these expressions, understand their mathematical structure, and examine them using additional mathematical analysis and application-specific knowledge. The verification of these expressions can also be made more stringent without changing the underlying discovery framework. In our evaluation, all 666 reported successful outputs remained accepted under the stricter positivity check. Thus, the demonstrated effectiveness of these outputs was retained under a stronger acceptance requirement. This flexibility allows stricter checks to be applied to the generated expressions, reducing the risk of accepting an invalid certificate and drawing an incorrect stability conclusion about potentially unstable dynamics. It is this combination of explicit symbolic outputs and adjustable verification requirements that makes the approach useful for further stability assessment.
Thank you again for this concern and the example provided in W1. Your comments have helped us clarify the intended use of our method and strengthen its evaluation. We hope this explanation, together with our response to W1, addresses your concerns.
Response to Reviewer rHen (3/4)
W3: Generalization to a wider range of systems
Thank you for raising this important concern. Neural symbolic Lyapunov discovery is still a developing field. Our main benchmarks combine equal numbers of held-out systems from conventional backward construction and solver-aware generation to provide a balanced comparison with existing methods. While this design covers both construction procedures, we agree that stronger evidence of generalization requires evaluation beyond them. We have therefore conducted additional experiments to complement the existing results.
To interpret these results, it is useful to first consider why success rates on ITW are low. As detailed in Appendix F, ITW directly samples dynamics without constructing reference Lyapunov functions and applies only basic filtering. Its success rates are therefore measured over a pool with unknown stability composition, rather than a known-stable test set. The possible presence of unstable systems, together with the difficulty of certificate discovery, can contribute to low success rates across methods. Nevertheless, this setting has practical relevance because a Lyapunov certificate is often sought precisely to establish stability when it is not already known. Such a search can support further system analysis and inform controller redesign when stabilization is needed. To better assess solving capability within this challenging setting, we extensively evaluated Alfarano et al.'s Symbolic Transformer [1] and SEVA-Lyap on a large pool of independently generated ITW polynomial systems, collected 200 systems per method with candidates satisfying our verification criterion, and cross-tested each method on the other method's subset to address your concern about the low aggregate success rates. The results are shown below.
| Subset selection (200 systems) | Evaluated method | Success rate |
|---|---|---|
| Solved by Symbolic Transformer | SEVA-Lyap | 91.00% |
| Solved by SEVA-Lyap | Symbolic Transformer | 9.00% |
By focusing on systems for which at least one method finds an accepted candidate, this experiment makes the difference in their solving capabilities clearer. SEVA-Lyap solves 91% of the sampled systems solved by Symbolic Transformer, whereas Symbolic Transformer solves only 9% of those sampled from SEVA-Lyap's successful cases. Thus, SEVA-Lyap covers most of the baseline's sampled successes while also solving many instances that the baseline does not solve. We believe these results provide additional evidence of our method's broader solving capability on independently generated systems.
The manuscript appendices complement this comparison by examining generalization from two further perspectives. Appendix G.2 evaluates transfer across different symbolic families without additional training or test-time adaptation on the target family. The results indicate that the Solver learns reusable structural relationships and can apply them beyond the symbolic operator distribution encountered during training. Appendix I then examines applicability to systems drawn from prior Lyapunov studies and established benchmark sources. On these systems, SEVA-Lyap discovers explicit symbolic candidates that pass verification, including instances not solved by Symbolic Transformer under the reported settings. Together, these evaluations extend the evidence beyond ITW by demonstrating both cross-family transfer and applicability to literature systems selected independently of our training-data construction.
We appreciate your suggestion, which has helped us strengthen the evaluation and explain its implications more clearly. We hope that the additional cross-testing results and the further explanation of the appendix experiments address your concern about generalization to a wider range of systems.
Response to Reviewer rHen (1/4)
Thank you for your careful review and constructive comments, which have helped us improve the manuscript. We have also revised the main text to clarify the novelty of our work, with the relevant changes highlighted in green. Below, we address each of your concerns in turn.
Thank you for raising this important concern and providing a concrete example. We agree that your example highlights the need for further explanation of our verification procedure. Below, we clarify how positive definiteness is ensured during data construction and how we have further checked the Solver's predictions.
For generated training pairs, strict positive definiteness is ensured by the rules used to assemble the symbolic components produced through adversarial generation, rather than inferred solely from SHGO acceptance. As described in Section 3 and Appendix C.3, the assembled target has the form
VGT(x)=Vproper(x)+∑k(qk(x)−qk(0))2,
where Vproper is a positive-definite base function with Vproper(0)=0. The additional squared terms are nonnegative and vanish at the origin. Consequently,
VGT(0)=0,VGT(x)≥Vproper(x)>0for x=0
on the admissible domain. The dynamics are also assembled so that
LfVGT(x)=−∑ihi(x)2(∂iVGT(x))2≤0.
During adversarial data evolution, the Generator learns the symbolic components, while these validity-preserving assembly rules remain fixed. Thus, a target such as V(x)=x12 in the reviewer's two-dimensional example cannot arise from this construction, since it lacks the required positive-definite base. SHGO serves as an additional numerical consistency check for these constructed pairs.
The inference stage requires a separate explanation, because an unconstrained Solver prediction does not automatically inherit this construction guarantee. Our SHGO-based procedure follows the numerical verification approach used in prior symbolic Lyapunov work [1], with a numerical tolerance τ in the acceptance rule. To describe this tolerance precisely, we explicitly write the numerical acceptance condition as mV≥−τ. This formulation distinguishes the implemented numerical criterion from a mathematical proof of positive definiteness.
To examine whether the tolerance affected the reported results, we rechecked all 666 final SHGO-accepted predictions contributing to our reported success rates. In this recheck, we replaced the positivity acceptance threshold mV≥−τ with the stricter requirement mV>0. All 666 predictions continued to pass. This provides evidence that their acceptance did not depend on allowing zero or slightly negative computed positivity minima. We also performed a dReal check using the same strict-positivity requirement and found no confirmed counterexamples, providing additional support for these recheck results.
We have added further explanations of the construction guarantee, the numerical acceptance criterion, and the stricter checks to the appendix, with the added text highlighted in orange. Thank you again for identifying this issue. Your comment has helped us describe the verification procedure and the scope of its guarantees more precisely. We hope these explanations and additional checks address your concern.