Robustness Analysis of Neural Networks via Efficient Partitioning with Applications in Control Systems
Michael Everett, Golnaz Habibi, Jonathan P. How

TL;DR
This paper introduces a unified approach to robustness analysis of neural networks that combines set propagation and partitioning techniques, resulting in tighter output bounds with less computational effort, crucial for safety-critical applications.
Contribution
It proposes a family of algorithms that unify propagation and partitioning for tighter bounds, along with new partitioning techniques aware of bound estimates and boundary shapes.
Findings
Tighter output bounds compared to existing methods.
Reduced conservatism in robustness estimates.
Effective application in control systems and reinforcement learning.
Abstract
Neural networks (NNs) are now routinely implemented on systems that must operate in uncertain environments, but the tools for formally analyzing how this uncertainty propagates to NN outputs are not yet commonplace. Computing tight bounds on NN output sets (given an input set) provides a measure of confidence associated with the NN decisions and is essential to deploy NNs on safety-critical systems. Recent works approximate the propagation of sets through nonlinear activations or partition the uncertainty set to provide a guaranteed outer bound on the set of possible NN outputs. However, the bound looseness causes excessive conservatism and/or the computation is too slow for online analysis. This paper unifies propagation and partition approaches to provide a family of robustness analysis algorithms that give tighter bounds than existing works for the same amount of computation time (or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
