Open- and Closed-Loop Neural Network Verification using Polynomial Zonotopes
We present a novel approach to efficiently compute tight non-convex enclosures of the image through neural networks with ReLU, sigmoid, or hyperbolic tangent activation functions. In particular, we abstract the input-output relation of each neuron by a polynomial approximation, which is evaluated in a set-based manner using polynomial zonotopes. While our approach can also can be beneficial for open-loop neural network verification, our main application is reachability analysis of neural network controlled systems, where polynomial zonotopes are able to capture the non-convexity caused by the neural network as well as the system dynamics. This results in a superior performance compared to other methods, as we demonstrate on various benchmarks.
Tue 16 MayDisplayed time zone: Central Time (US & Canada) change
14:00 - 15:30 | |||
14:00 25mTalk | Verifying Attention Robustness of Deep Neural Networks against Semantic Perturbations NFM 2023 Satoshi Munakata Fujitsu, Caterina Urban Inria & École Normale Supérieure | Université PSL, Haruki Yokoyama , Koji Yamamoto Fujitsu, Kazuki Munakata Fujitsu | ||
14:25 25mTalk | Verification of LSTM Neural Networks with Non-linear Activation Functions NFM 2023 | ||
14:50 25mTalk | Open- and Closed-Loop Neural Network Verification using Polynomial Zonotopes NFM 2023 Niklas Kochdumper Stony Brook University, Christian Schilling Aalborg University, Matthias Althoff Technichal University of Munich, Stanley Bak Stony Brook University Pre-print | ||
15:15 15mTalk | Verifying an Aircraft Collision Avoidance Neural Network with Marabou NFM 2023 |