Robustness verification of ReLU networks via quadratic programming

DOI10.1007/S10994-022-06132-9MaRDI QIDQ2102314zbMATH OpenOpenAlexFDO

Authors Aleksei Kuvshinov, Stephan Günnemann

Publication date 28 November 2022

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-022-06132-9

zbMATH Keywords

machine learningminimal adversarial perturbationneural networksquadratic programmingrobustness verification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Formal verification of piece-wise linear feed-forward neural networks
• Reluplex: an efficient SMT solver for verifying deep neural networks

Cited in

(4)

• Improved geometric path enumeration for verifying ReLU neural networks
• Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
• \textsc{OccRob}: efficient SMT-based occlusion robustness verification of deep neural networks
• Robustness verification of semantic segmentation neural networks using relaxed reachability

Describes a project that uses

Uses Software

• MNIST
• Gurobi
• UCI

This page was built for publication: Robustness verification of ReLU networks via quadratic programming

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