Efficient neural network analysis with sum-of-infeasibilities
From MaRDI portal
Publication:6535564
Recommendations
- Formal verification of piece-wise linear feed-forward neural networks
- Branch and bound for piecewise linear neural network verification
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Reluplex: a calculus for reasoning about deep neural networks
- Sparse polynomial optimisation for neural network verification
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- An introduction to MCMC for machine learning
- Branch and bound for piecewise linear neural network verification
- Experiments in mixed-integer linear programming
- Formal verification of piece-wise linear feed-forward neural networks
- Handbook of Markov Chain Monte Carlo
- Improved geometric path enumeration for verifying ReLU neural networks
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Safety verification of deep neural networks
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Verification of deep convolutional neural networks using ImageStars
Cited in
(3)
This page was built for publication: Efficient neural network analysis with sum-of-infeasibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535564)