GoTube: Scalable Stochastic Verification of Continuous-Depth Models

07/18/2021
by   Sophie A. Neubauer, et al.
11

We introduce a new stochastic verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. The algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability. GoTube is implemented in JAX and optimized to scale to complex continuous-depth models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube provably does not accumulate over-approximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability, on a large set of experiments. GoTube is stable and sets the state-of-the-art for its ability to scale up to time horizons well beyond what has been possible before.

READ FULL TEXT
research
12/16/2020

On The Verification of Neural ODEs with Stochastic Guarantees

We show that Neural ODEs, an emerging class of time-continuous neural ne...
research
09/21/2023

Reachability Analysis of ARMAX Models

Reachability analysis is a powerful tool for computing the set of states...
research
12/14/2020

Lagrangian Reachtubes: The Next Generation

We introduce LRT-NG, a set of techniques and an associated toolset that ...
research
05/12/2023

Parameterized Verification of Disjunctive Timed Networks

We introduce new techniques for the parameterized verification of disjun...
research
11/02/2021

Conservative Time Discretization: A Comparative Study

We present the first review of methods to overapproximate the set of rea...
research
07/09/2020

Symbolic Reachability Analysis of High Dimensional Max-Plus Linear Systems

This work discusses the reachability analysis (RA) of Max-Plus Linear (M...
research
09/20/2018

Tight Continuous-Time Reachtubes for Lagrangian Reachability

We introduce continuous Lagrangian reachability (CLRT), a new algorithm ...

Please sign up or login with your details

Forgot password? Click here to reset