eess.SYNov 16, 2026

Learning and Verifying Stabilizing Controllers with Structured Neural Control Lyapunov Functions

Authors: Jose Luis Ledesma Martin, Patricia Pauli

Organizations: Department of Mechanical Engineering, Delft University of Technology, Delft, 2628 CD Delft, The Netherlands · Department of Mechanical Engineering, Eindhoven University of Technology, 5612 AZ Eindhoven, The Netherlands

Abstract

This work investigates the joint learning of neural controllers and control Lyapunov functions (CLFs) for nonlinear discrete-time systems. We exploit the structural properties of Input Convex Neural Networks and Polyak-Łojasiewicz Networks to guarantee positive definiteness of CLF candidates by construction, reducing the conditions requiring formal verification. We develop a mixed-integer programming framework to formally verify the remaining stability conditions and introduce an iterative region of attraction (ROA) expansion procedure to enlarge the certified ROA without retraining. Experiments on an inverted pendulum and a path-tracking system demonstrate the advantages of structured neural CLFs, particularly PLNets, and illustrate how their structural bounds influence the geometry of the certified regions. Our code is available at: https://github.com/JLedesMart/Structured-Neural-Control-Lyapunov-Functions.

Figures & tables

Explore similar work

Nov 16, 2026

Joint Learning of Control Lyapunov Functions and Controllers via Stable-by-Design Surrogates

Training and verifying neural network-based control Lyapunov functions (CLFs) can be computationally demanding. To address this challenge, we propose a framework that jointly learns a CLF and a stabilizing controller using structured neural networks and a projection-based parameterization. Specifically, we employ Polyak-Lojasiewicz networks (PLNets), which parameterize nonconvex, positive-definite CLF candidates, and construct a stable-by-design surrogate of the closed-loop dynamics that satisfies the Lyapunov decrease condition by construction. The controller combines linear state feedback with a higher-order correction term resembling Sontag's universal formula and is trained to align the resulting closed-loop dynamics with the stable-by-design surrogate. Unlike classical approaches based on Sontag's formula, our framework does not require a known CLF; instead, it learns the CLF and controller simultaneously. We establish local and global stability guarantees for the learned controller and demonstrate the effectiveness of the proposed approach through numerical examples.
Aug 2, 2024

Certified Robust Invariant Polytope Training in Neural Controlled ODEs

We propose a framework for training neural network controllers with certified robust forward invariant polytopes. First, we parameterize a family of lifted control systems in a higher dimensional space, where the original neural controlled system evolves on an invariant subspace of each lifted system. We use interval analysis and neural network verifiers to further construct a family of lifted embedding systems, carefully capturing the knowledge of this invariant subspace. If the vector field of any lifted embedding system satisfies a sign constraint at a single point, then a certain convex polytope of the original system is robustly forward invariant. Treating the neural network controller and the lifted system parameters as variables, we propose an algorithm to train controllers with certified forward invariant polytopes in the closed-loop control system. Through two examples, we demonstrate how the simplicity of the sign constraint allows our approach to scale with system dimension to over 5050 states, and outperform state-of-the-art Lyapunov-based sampling approaches in runtime.
Nov 16, 2026

Hyperlyve: Parallelized Enumeration and Exact Lyapunov Stability Certification for Deep ReLU Networks

We introduce Hyperlyve (Hyperplane Partitioned Lyapunov Verification and Enumeration), a framework for proving the asymptotic stability of nonlinear dynamical systems, including those with neural network controllers. Hyperlyve learns and formally certifies continuous piecewise-affine (CPA) neural Lyapunov functions within a counterexample-guided inductive synthesis (CEGIS) loop. Hyperlyve's key innovation is a parallel algorithm that enumerates the hyperplane arrangement formed by the ReLU activations of deep networks and certifies that Lyapunov conditions hold within each polyhedral region. We derive sound and complete regional tests to verify the asymptotic stability of the exact smooth dynamics (rather than a piecewise-linear approximation) within a compact domain of interest. Furthermore, we formally characterize the computational complexity of the CPA neural Lyapunov verification problem as co-NP-complete, filling a key gap in the literature. Empirical results demonstrate that Hyperlyve enumerates ReLU networks over 150-times faster than competing tools, which contributes to Hyperlyve proving the asymptotic stability of systems that are currently intractable for state-of-the-art verifiers.