- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Zubov-Net multiplies a local Lyapunov function by a learned positive correction, guaranteeing local Lyapunov conditions, proving universal approximation of maximal Lyapunov functions, and certifying larger verified regions of attraction.
Critical strengths
Because Zubov-Net multiplies a known local Lyapunov function (the "anchor") by a positive correction, the output satisfies the strict Lyapunov conditions near the equilibrium for every parameter setting (Prop. 1). This removes a known weak point where small approximation errors at the origin break the certificate.
A universal approximation theorem (Thm. 1) shows that anchored networks can approximate a maximal Lyapunov function and its derivatives uniformly on compact subsets of the region of attraction. The union of their certified sublevel sets covers the whole constrained region.
Critical weaknesses
The training target (the Zubov PDE), the data and PDE loss terms, the counterexample-guided training loop and the α-β-CROWN verification all closely follow Liu et al. (2023; 2024b; 2025). The new part is mainly the multiplicative anchor, yet the main comparisons are against SOS certificates.
Questions for authors
None
Response to reviewer UHC5
Thank you for your positive assessment of our paper and for your comment on its relationship to prior neural methods. We build directly on the Zubov PDE formulation, trajectory supervision, and PDE losses of Liu et al. (2023; 2025). Our implementation extends LyZNet (Liu et al., 2024b) and uses established counterexample-guided refinement and α-β-CROWN verification tools. Appendix E.1 now distinguishes this inherited framework from our theoretical and empirical contributions.
Our theoretical contribution is the anchored representation and its guarantees. Under Assumption 1, we prove that the multiplicative correction preserves positive definiteness and strict local decrease for every fixed parameter vector (Proposition 1). In Theorem 1, we show that invariant sublevel components of anchored networks exhaust the constrained ROA under the theorem's assumptions. We also simplify derivative verification through the architecture's exact factorization (Proposition 3) and allow certified sets to include constraint-boundary portions with strict inward flow (Proposition 2).
Systematic empirical evaluation is another main contribution. We apply one common recipe to the twelve 2D benchmarks and another to the four 3D benchmarks, obtaining certified ROAs larger than the SOS baselines across both suites (Tables 1 and 2). For higher-dimensional systems, we tailor training and architectures to their dynamics and sparsity. We emphasize SOS comparisons to extend the selected examples in Liu et al. (2025) into a systematic evaluation spanning common recipes and higher-dimensional systems. We retain several examples from that work, including the Van der Pol oscillators, two-machine swing system, and 20D Van der Pol network. On this network, our training procedure improves the estimated verified volume by 13% over the frozen neural baseline of Liu et al. (2024a), as reported in Table 4. The 5D aircraft comparison gives a further 42% gain, from 8,567 to 12,168, over the MLP baseline (Table 3). We match network size, trajectory data, and optimizer-update count while using losses suited to each representation (Appendix E.1).