Neuron pairs in binarized neural networks robustness verification via integer linear programming

DOI10.1007/978-3-031-60924-4_23MaRDI QIDQ7030712zbMATH OpenFDO

Authors Dymitr Lubczyk, José Neto

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_23

zbMATH Keywords

cutting-planedisjunctive programmingrobustness verification

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A Primer on Neural Network Models for Natural Language Processing
• An SMT-based approach for verifying binarized neural networks
• Multilayer feedforward networks are universal approximators
• Reluplex: a calculus for reasoning about deep neural networks
• Strong mixed-integer programming formulations for trained neural networks

This page was built for publication: Neuron pairs in binarized neural networks robustness verification via integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030712)