Training for faster adversarial robustness verification via inducing Relu stability

We explore the concept of co-design in the context of neural network verification. Specifically, we aim to train deep neural networks that not only are robust to adversarial perturbations but also whose robustness can be verified more easily. To this end, we identify two properties of network models...

Full description

Bibliographic Details
Main Authors: Xiao, Kai Yuanqing (Author), Tjeng, Vincent (Author), Shafiullah, Nur Muhammad Mahi (Author), Mądry, Aleksander (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: ICLR, 2021-03-09T18:40:41Z.
Subjects:
Online Access:Get fulltext
LEADER 01830 am a22002293u 4500
001 130110
042 |a dc 
100 1 0 |a Xiao, Kai Yuanqing  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
700 1 0 |a Tjeng, Vincent  |e author 
700 1 0 |a Shafiullah, Nur Muhammad Mahi.  |e author 
700 1 0 |a Mądry, Aleksander  |e author 
245 0 0 |a Training for faster adversarial robustness verification via inducing Relu stability 
260 |b ICLR,   |c 2021-03-09T18:40:41Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/130110 
520 |a We explore the concept of co-design in the context of neural network verification. Specifically, we aim to train deep neural networks that not only are robust to adversarial perturbations but also whose robustness can be verified more easily. To this end, we identify two properties of network models - weight sparsity and so-called ReLU stability - that turn out to significantly impact the complexity of the corresponding verification task. We demonstrate that improving weight sparsity alone already enables us to turn computationally intractable verification problems into tractable ones. Then, improving ReLU stability leads to an additional 4-13x speedup in verification times. An important feature of our methodology is its "universality," in the sense that it can be used with a broad range of training procedures and verification approaches. 
520 |a National Science Foundation (U.S.). Graduate Research Fellowship Program (Grant 1122374) 
520 |a National Science Foundation (U.S.) (Grants CCF-1553428 and CNS-1815221) 
520 |a Lockheed Martin (Award number RPP2016-002) 
546 |a en 
655 7 |a Article 
773 |t 7th International Conference on Learning Representations, ICLR 2019