Out of the Shadows: Exploring a Latent Space for Neural Network Verification
Lukas Koller, Tobias Ladner, Matthias Althoff
Abstract
Neural networks are ubiquitous. However, they are often sensitive to small input changes. Hence, to prevent unexpected behavior in safety-critical applications, their formal verification -- a notoriously hard problem -- is necessary. Many state-of-the-art verification algorithms use reachability analysis or abstract interpretation to enclose the set of possible outputs of a neural network. Often, the verification is inconclusive due to the conservatism of the enclosure. To address this problem, we propose a novel specification-driven input refinement procedure, i.e., we iteratively enclose the preimage of a neural network for all unsafe outputs to reduce the set of possible inputs to only enclose the unsafe ones. For that, we transfer output specifications to the input space by exploiting a latent space, which is an artifact of the propagation of a projection-based set representation through a neural network. A projection-based set representation, e.g., a zonotope, is a "shadow" of a higher-dimensional set -- a latent space -- that does not change during a set propagation through a neural network. Hence, the input set and the output enclosure are "shadows" of the same latent space that we can use to transfer constraints. We present an efficient verification tool for neural networks that uses our iterative refinement to significantly reduce the number of subproblems in a branch-and-bound procedure. Using zonotopes as a set representation, unlike many other state-of-the-art approaches, our approach can be realized by only using matrix operations, which enables a significant speed-up through efficient GPU acceleration. We demonstrate that our tool achieves competitive performance compared to the top-ranking tools of the international neural network verification competition.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 905e1a2c-9769-421c-84b7-82fc881b6a27Cited by top-tier papers1
Ask how each one uses itBuilds on6
- Towards Evaluating the Robustness of Neural NetworksNicholas Carlini, David A. WagnerS&P 2017 · 9,786 citations
- Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Neural Network Robustness VerificationShiqi Wang, Huan Zhang, Kaidi Xu, Xue Lin et al.NeurIPS 2021 · 359 citations
- Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete VerifiersKaidi Xu, Huan Zhang, Shiqi Wang, Yihan Wang et al.ICLR 2021 · 250 citations
- Complete Verification via Multi-Neuron Relaxation Guided Branch-and-BoundClaudio Ferrari, Mark Niklas Müller, Nikola Jovanovic, Martin T. VechevICLR 2022 · 117 citations
- PRIMA: general and precise neural network certification via scalable convex hull approximationsMark Niklas Müller, Gleb Makarchuk, Gagandeep Singh, Markus Püschel et al.POPL 2022 · 75 citations
Related papers
- Zonotope Domains for Lagrangian Neural Network VerificationMatt Jordan, Jonathan Hayase, Alex Dimakis, Sewoong OhNeurIPS 2022 · 6 citations
- Provably Bounding Neural Network PreimagesSuhas Kotha, Christopher Brix, J. Zico Kolter, Krishnamurthy Dvijotham et al.NeurIPS 2023 · 41 citations
- The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network VerificationChristian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma et al.NeurIPS 2020 · 102 citations
- Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network VerificationDuo Zhou, Jorge Chavez, Hesun Chen, Grani A. Hanasusanto et al.NeurIPS 2025 · 10 citations
- Verification of Neural-Network Control Systems by Integrating Taylor Models and ZonotopesChristian Schilling, Marcelo Forets, Sebastián GuadalupeAAAI 2022 · 48 citations
