Robustness verification of ReLU networks via quadratic programming

DOI10.1007/S10994-022-06132-9OpenAlexW4221035791MaRDI QIDQ2102314

Aleksei Kuvshinov, Stephan Günnemann

Publication date: 28 November 2022

Published in: Machine Learning (Search for Journal in Brave)

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

zbMATH Keywords

quadratic programmingneural networksmachine learningrobustness verificationminimal adversarial perturbation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• UCI-ml
• Gurobi
• MNIST

Cites Work

• Reluplex: an efficient SMT solver for verifying deep neural networks
• Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks

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