Verifying generalization in deep learning
From MaRDI portal
Publication:6535549
Recommendations
Cites work
- scientific article; zbMATH DE number 2050727 (Why is no real title available?)
- An SMT-based approach for verifying binarized neural networks
- Bisimulations for neural network reduction
- Deep learning
- DeepSafe: a data-driven approach for assessing robustness of neural networks
- Efficient neural network analysis with sum-of-infeasibilities
- Formal specification for deep neural networks
- Formal verification of neural network controlled autonomous systems
- Formal verification of piece-wise linear feed-forward neural networks
- Natural language processing (almost) from scratch
- Neural network repair with reachability analysis
- Probabilistic Horn clause verification
- Reachability analysis for neural feedback systems using regressive polynomial rule inference
- Reinforcement learning. An introduction
- Reluplex: a calculus for reasoning about deep neural networks
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Run-time optimization for learned controllers through quantitative games
- Safety verification of deep neural networks
- Static analysis of ReLU neural networks with tropical polyhedra
- Verifying Recurrent Neural Networks Using Invariant Inference
This page was built for publication: Verifying generalization in deep learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535549)