Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning

Alexander DavydovarXiv 2025 · DOI · arXiv

Abstract

This paper introduces a scalable framework for proving that neural network-based controllers remain stable and robust in nonlinear systems. By combining contraction theory with interval bound propagation (IBP) and a novel Metzler matrix condition, the authors provide a method to verify and train controllers that are mathematically guaranteed to converge. This approach bypasses the need for computationally expensive formal methods like SMT solvers. The framework is demonstrated on an inverted pendulum, achieving certified contraction over a significant portion of the operational range.

Introduction

Designing controllers for complex, nonlinear systems, such as robotics or chemical processing plants, remains a significant challenge. While Neural Networks (NNs) excel at learning complex control laws, they are often viewed as "black boxes" lacking formal safety or stability guarantees. Unpredictable behavior in unseen states is a major barrier to deployment in safety-critical applications.

Existing formal verification methods, such as Lyapunov stability analysis using Satisfiability Modulo Theories (SMT) or Branch-and-Bound (BnB) algorithms, are mathematically rigorous but suffer from poor scalability. These methods become exponentially slower as system complexity increases, making them difficult to integrate into the training process. This research addresses the need for a verification method that is both rigorous and computationally efficient enough for "verification-in-the-loop" training.

Methodology

The proposed framework centers on Contraction Analysis, where stability is defined by the exponential convergence of all possible trajectories toward one another.

Metzler Majorant Condition

The authors derive a new sufficient condition for contraction. Instead of an exhaustive point-by-point check, they demonstrate that if the dominant eigenvalue of a specific "Metzler matrix" (a matrix with non-negative off-diagonal elements) is non-positive, the system is guaranteed to be contracting. This provides a sharper bound than previous methods.

Interval Bound Propagation (IBP) for Jacobians

To handle the nonlinearities of neural networks, the authors utilize IBP to find the "worst-case" upper and lower bounds of the network's outputs and derivatives (Jacobians) over specific regions.

Algorithm 1: Computing interval bounds for the Jacobian of a neural network.

Domain Partitioning and Training

Because IBP can be conservative over large areas, the state space is partitioned into smaller hyperrectangles. Contraction is verified on each box individually, allowing for the certification of larger regions. This verification step is integrated directly into the loss function; any violation of the contraction condition in a region is added to the training loss, forcing the network toward a stable control law.

The method was evaluated using the Inverted Pendulum benchmark, a classic nonlinear system that is naturally unstable in open-loop.

Results and Discussion

The framework successfully trained and certified a neural controller and a neural contraction metric for the inverted pendulum. By iteratively growing the certified region from a small area around the equilibrium, the authors achieved a certified contraction region covering $\theta \in \pm 160^\circ$ and $\dot{\theta} \in \pm 5.33$ rad/s (approx. $89\pi/100$ rad).

Closed-loop vector field showing trajectories converging to the equilibrium point.

Key Insights

  • Scalability: Moving from SMT-based verification to eigenvalue checks on Metzler matrices enables verification to run thousands of times during training.
  • Robustness: Contraction is a stronger guarantee than standard stability, implying Input-to-State Stability (ISS) and robustness against noise.
  • Partitioning Power: Proving stability in "pieces" allows for the certification of complex global behaviors that a single global proof might fail to capture.

Conclusion

While the framework offers significant scalability improvements, it still faces the "curse of dimensionality" as the number of state variables increases. Future work may involve using more advanced bounding techniques like CROWN to reduce IBP conservatism or exploring non-Euclidean Finsler metrics to verify more complex, non-smooth systems.

Summary updated

Abstract

We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks. By leveraging interval analysis and interval bound propagation, we derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive. We combine this sufficient condition with a domain partitioning strategy to integrate this sufficient condition into training. The proposed approach is validated on an inverted pendulum system, demonstrating the ability to learn neural network controllers and contraction metrics that provably satisfy the contraction condition.
BibTeX
@misc{davydov2025verifying,
  author = {Alexander Davydov},
  title = {{Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning}},
  year = {2025},
  eprint = {2512.02262},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2512.02262},
}
Figure