Example Guided Synthesis of Linear Approximations for Neural Network Verification
From MaRDI portal
Example Guided Synthesis of Linear Approximations for Neural Network Verification
Recommendations
- Formal verification of piece-wise linear feed-forward neural networks
- Advances in verification of ReLU neural networks
- Toward neural-network-guided program synthesis and verification
- Branch and bound for piecewise linear neural network verification
- An abstraction-based framework for neural network verification
Cites work
- Algorithm 852
- An efficient and safe framework for solving optimization problems
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Contractor programming
- DiffRNN: differential verification of recurrent neural networks
- dReal: an SMT solver for nonlinear theories over the reals
- Formal verification of piece-wise linear feed-forward neural networks
- Introduction to Interval Analysis
- Quad trees: A data structure for retrieval by composite keys
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Safety verification of deep neural networks
- Scalable polyhedral verification of recurrent neural networks
- Upper bounding in inner regions for global optimization under inequality constraints
Cited in
(3)
This page was built for publication: Example Guided Synthesis of Linear Approximations for Neural Network Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487316)
