TL;DR
This paper introduces a probabilistic verification method for neural networks using semidefinite programming, enabling safety analysis and confidence ellipsoid estimation under input uncertainties with known moments.
Contribution
It proposes a novel approach to probabilistic safety verification and confidence ellipsoid estimation for neural networks by abstracting nonlinear activations with affine and quadratic constraints.
Findings
Effective semidefinite programming-based analysis.
Successful numerical experiments demonstrating approach.
Improved safety bounds under probabilistic input uncertainties.
Abstract
Quantifying the robustness of neural networks or verifying their safety properties against input uncertainties or adversarial attacks have become an important research area in learning-enabled systems. Most results concentrate around the worst-case scenario where the input of the neural network is perturbed within a norm-bounded uncertainty set. In this paper, we consider a probabilistic setting in which the uncertainty is random with known first two moments. In this context, we discuss two relevant problems: (i) probabilistic safety verification, in which the goal is to find an upper bound on the probability of violating a safety specification; and (ii) confidence ellipsoid estimation, in which given a confidence ellipsoid for the input of the neural network, our goal is to compute a confidence ellipsoid for the output. Due to the presence of nonlinear activation functions, these two…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
