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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SAVER: A Toolbox for SAmpling-Based, Probabilistic VERification of Neural Networks

Krishna C. Kalagarla, Alex Devonport, Meeko Oishi, Panagiotis Tsiotras et al.
Adversarial Robustness in Machine Learning
article

SAVER: A Toolbox for SAmpling-Based, Probabilistic VERification of Neural Networks

Krishna C. Kalagarla, Alex Devonport, Meeko Oishi, Panagiotis Tsiotras, Vignesh Sivaramakrishnan, Joshua Pilipovsky
article en

Abstract

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.

Georgia Institute of Technology (US), University of New Mexico (US)
National Science Foundation, National Aeronautics and Space Administration, Nuclear Safety and Security Commission, Air Force Research Laboratory
Openalex Percentile: Top 95%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.