Neural network verification's hardest open problems are reframed as programming language design challenges, with a unified dependently typed language proposed as the ideal solution.
Verifying Global Two-Safety Properties in Neural Networks with Confidence
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present the first automated verification technique for confidence-based 2-safety properties, such as global robustness and global fairness, in deep neural networks (DNNs). Our approach combines self-composition to leverage existing reachability analysis techniques and a novel abstraction of the softmax function, which is amenable to automated verification. We characterize and prove the soundness of our static analysis technique. Furthermore, we implement it on top of Marabou, a safety analysis tool for neural networks, conducting a performance evaluation on several publicly available benchmarks for DNN verification.
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Neural Network Verification is a Programming Language Challenge
Neural network verification's hardest open problems are reframed as programming language design challenges, with a unified dependently typed language proposed as the ideal solution.