SAVER: A Toolbox for SAmpling-Based, Probabilistic VERification of Neural Networks
We present a neural network verification toolbox to 1) assess the probability of satisfaction of a constraint, and 2) modify the set to achieve the probability of satisfaction. Specifically, the tool box establishes with a user-specified level of confidence whether the output of the neural network for a given input distribution is likely to be contained within a given set. Should the tool determine that the given set cannot satisfy the likelihood constraint, the tool also implements an approach outlined in this paper to alter the set to ensure that the user-defined satisfaction probability is achieved. The toolbox is comprised of sampling-based approaches which exploit the properties of signed distance function to define set containment.
Authors
- Krishna C. Kalagarla (ORCID: https://orcid.org/0000-0003-0618-8342)
- Alex Devonport (ORCID: https://orcid.org/0000-0003-1913-5637)
- Meeko Oishi (ORCID: https://orcid.org/0000-0003-3722-8837)
- Panagiotis Tsiotras (ORCID: https://orcid.org/0000-0001-7563-4129)
- Vignesh Sivaramakrishnan (ORCID: https://orcid.org/0000-0003-1127-9628)
- Joshua Pilipovsky (ORCID: https://orcid.org/0000-0001-6217-6042)
Institutions
- Georgia Institute of Technology (US)
- University of New Mexico (US)
Publication Details
- Published
- 2025-05-06
- DOI
- https://doi.org/10.1145/3716863.3718045
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- National Aeronautics and Space Administration
- Nuclear Safety and Security Commission
- Air Force Research Laboratory