Neural Network Verification using Residual Reasoning
Yizhak Yisrael Elboher, Elazar Cohen, Guy Katz

TL;DR
This paper introduces a residual reasoning technique to improve the scalability and efficiency of neural network verification by reusing information across abstraction-refinement steps, implemented in the Marabou verifier.
Contribution
It presents a novel residual reasoning method that leverages previous verification information to accelerate the verification of refined neural network abstractions.
Findings
Enhanced verification speed with residual reasoning
Reduced need for repeated verification of unchanged parts
Promising results demonstrating scalability improvements
Abstract
With the increasing integration of neural networks as components in mission-critical systems, there is an increasing need to ensure that they satisfy various safety and liveness requirements. In recent years, numerous sound and complete verification methods have been proposed towards that end, but these typically suffer from severe scalability limitations. Recent work has proposed enhancing such verification techniques with abstraction-refinement capabilities, which have been shown to boost scalability: instead of verifying a large and complex network, the verifier constructs and then verifies a much smaller network, whose correctness implies the correctness of the original network. A shortcoming of such a scheme is that if verifying the smaller network fails, the verifier needs to perform a refinement step that increases the size of the network being verified, and then start verifying…
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.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI) · Fault Detection and Control Systems
