Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques

Sophie A. Neubauer, Radu GrosuarXiv 2023 · DOI · arXiv

Abstract

Ensuring the reliability of Neural Ordinary Differential Equations (Neural ODEs) is critical for safety-sensitive applications. This paper presents a unified Lagrangian framework for verifying the robustness of continuous-depth models. By integrating deterministic algorithms (LRT-NG) with scalable statistical methods (GoTube), the authors achieve tight reachability bounds that surpass existing state-of-the-art tools in speed, accuracy, and long-term stability.

Introduction

Neural ODEs are increasingly deployed in cyber-physical systems like autonomous vehicles and medical devices. However, their nonlinear dynamics lack closed-form solutions, making exact behavior prediction mathematically undecidable. Traditional verification relies on reachability analysis—over-approximating the set of reachable states. A persistent challenge is the wrapping effect, where approximation errors accumulate over time, causing "reachtubes" to expand uncontrollably. Existing tools often fail to scale to high-dimensional neural networks or provide guarantees over extended time horizons.

Methodology: Lagrangian Verification

The authors propose a suite of Lagrangian-verification techniques that focus on the evolution of individual trajectories and their perturbations, rather than tracking sets of states directly.

Comparison of reachability analysis techniques across various properties.

1. LRT-NG (Deterministic)

LRT-NG provides conservative, guaranteed bounds through two key innovations:

  • Optimal Metric Computation: Analytically solving an optimization problem to determine the ideal ellipsoid shape that minimizes reachtube volume.
  • Ball-Ellipsoid Intersection: Combining an optimal ellipsoid with an Euclidean ball to significantly tighten bounds and mitigate the wrapping effect.

2. SLR & GoTube (Statistical)

GoTube addresses the scalability limits of deterministic methods:

  • Statistical Lipschitz Caps: Utilizing random sampling and statistical quantiles instead of computationally expensive interval arithmetic.
  • Scalability: A tensorized batch-sampling approach allows for high-confidence statistical guarantees (e.g., 99%) on complex systems.

Experimental Evaluation

The tools were evaluated on classical benchmarks (e.g., Van Der Pol oscillator, Robotarm) and neural network models, including a new 16-dimensional CT-RNN benchmark designed to test high-dimensional scalability.

Key Results

  • Superior Tightness: LRT-NG and GoTube consistently produced tighter reachtube volumes than established tools like Flow* and CAPD.
  • Neural ODE Handling: LRT-NG was the only conservative tool capable of processing continuous-depth neural network benchmarks without failure.
  • Extended Horizons: On the Dubins Car model, GoTube maintained useful bounds beyond 40 seconds, while competing tools failed before 20 seconds.
Visualization of reachability tubes for LRT-NG and GoTube compared to sample traces.

Discussion and Insights

A central insight is the use of variational equations to track the "deformation gradient," mapping how initial perturbations evolve. Furthermore, the authors demonstrate a trade-off between certainty and scalability: for many applications, a high-confidence statistical bound over a long horizon is more valuable than a deterministic bound that "blows up" quickly. GoTube's "tightness factor" ($\mu$) allows users to navigate this Pareto-front based on hardware and precision requirements.

Conclusion

While these techniques show significant promise, they currently require an explicit ODE model of the environment. Future work aims to scale these methods to even higher dimensions and explore scenarios where environment models are learned or handled in a model-free manner.

Summary updated

Abstract

This paper presents, in a unified fashion, deterministic as well as statistical Lagrangian-verification techniques. They formally quantify the behavioral robustness of any time-continuous process, formulated as a continuous-depth model. To this end, we review LRT-NG, SLR, and GoTube, algorithms for constructing a tight reachtube, that is, an over-approximation of the set of states reachable within a given time-horizon, and provide guarantees for the reachtube bounds. We compare the usage of the variational equations, associated to the system equations, the mean value theorem, and the Lipschitz constants, in achieving deterministic and statistical guarantees. In LRT-NG, the Lipschitz constant is used as a bloating factor of the initial perturbation, to compute the radius of an ellipsoid in an optimal metric, which over-approximates the set of reachable states. In SLR and GoTube, we get statistical guarantees, by using the Lipschitz constants to compute local balls around samples. These are needed to calculate the probability of having found an upper bound, of the true maximum perturbation at every timestep. Our experiments demonstrate the superior performance of Lagrangian techniques, when compared to LRT, Flow*, and CAPD, and illustrate their use in the robustness analysis of various continuous-depth models.
BibTeX
@misc{neubauer2023robustness,
  author = {Sophie A. Neubauer and Radu Grosu},
  title = {{Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques}},
  year = {2023},
  eprint = {2308.12192},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2308.12192},
}
Figure