Abstract Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep Neural Networks (DNNs) are rapidly being applied to safety-critical domains such as drone and airplane control, motivating techniques for verifying the safety of their behavior. Unfortunately, DNN verification is NP-hard, with current algorithms slowing exponentially with the number of nodes in the DNN. This paper introduces the notion of Abstract Neural Networks (ANNs), which can be used to soundly overapproximate DNNs while using fewer nodes. An ANN is like a DNN except weight matrices are replaced by values in a given abstract domain. We present a framework parameterized by the abstract domain and activation functions used in the DNN that can be used to construct a corresponding ANN. We present necessary and sufficient conditions on the DNN activation functions for the constructed ANN to soundly over-approximate the given DNN. Prior work on DNN abstraction was restricted to the interval domain and ReLU activation function. Our framework can be instantiated with other abstract domains such as octagons and polyhedra, as well as other activation functions such as Leaky ReLU, Sigmoid, and Hyperbolic Tangent.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 4; 2024: 2; 2025: 1.
11 papers.
- 2021A Review of Formal Methods applied to Machine Learningcited by 33
- 2022Tighter Abstract Queries in Neural Network Verificationcited by 8
- 2021Bisimulations for Neural Network Reductioncited by 6
- 2023Fully Automatic Neural Network Reduction for Formal Verificationcited by 6
- 2024Relational DNN Verification With Cross Executional Bound Refinementcited by 5
- 2023Expediting Neural Network Verification via Network Reductioncited by 1
- 2024Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deploymentcited by 1
- 2022A Domain-Theoretic Framework for Robustness Analysis of Neural Networkscited by 0
- 2023Syntactic vs Semantic Linear Abstraction and Refinement of Neural Networkscited by 0
- 2023Verification of Neural Networks Local Differential Classification Privacycited by 0
- 2025Random at First, Fast at Last: NTK-Guided Fourier Pre-Processing for Tabular DLcited by 0
- 2025Random at First, Fast at Last: NTK-Guided Fourier Pre-Processing for Tabular DL3 Jun 2025
- 2024Relational DNN Verification With Cross Executional Bound Refinement16 May 2024
- 2024Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment26 Jan 2024
- 2023Verification of Neural Networks Local Differential Classification Privacy31 Oct 2023
- 2023Expediting Neural Network Verification via Network Reduction7 Aug 2023
- 2023Syntactic vs Semantic Linear Abstraction and Refinement of Neural Networks20 Jul 2023
- 2023Fully Automatic Neural Network Reduction for Formal Verification3 May 2023
- 2022Tighter Abstract Queries in Neural Network Verification23 Oct 2022
- 2022A Domain-Theoretic Framework for Robustness Analysis of Neural Networks1 Mar 2022
- 2021Bisimulations for Neural Network Reduction7 Oct 2021
- 2021A Review of Formal Methods applied to Machine Learning6 Apr 2021