Verifying generalization in deep learning

DOI10.1007/978-3-031-37703-7_21zbMATH Open1545.68067MaRDI QIDQ6535549

Osher Maayan, Tom Zelazny, Guy Amir, Michael Schapira, Guy Katz

Publication date: 12 January 2024

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neural network repair with reachability analysis
• Static analysis of ReLU neural networks with tropical polyhedra
• Safety verification of deep neural networks
• Reluplex: an efficient SMT solver for verifying deep neural networks
• Bisimulations for neural network reduction
• An SMT-based approach for verifying binarized neural networks
• Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
• Probabilistic Horn Clause Verification
• Formal verification of neural network controlled autonomous systems
• Reachability analysis for neural feedback systems using regressive polynomial rule inference
• Reluplex: a calculus for reasoning about deep neural networks
• DeepSafe: a data-driven approach for assessing robustness of neural networks
• Formal specification for deep neural networks
• Run-time optimization for learned controllers through quantitative games
• Verifying Recurrent Neural Networks Using Invariant Inference
• Efficient neural network analysis with sum-of-infeasibilities

Related Items (1)

Verifying the generalization of deep learning to out-of-distribution domains

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)