Towards Evaluating and Training Verifiably Robust Neural Networks
arXiv:2104.00447
Abstract
Recent works have shown that interval bound propagation (IBP) can be used to train verifiably robust neural networks. Reseachers observe an intriguing phenomenon on these IBP trained networks: CROWN, a bounding method based on tight linear relaxation, often gives very loose bounds on these networks. We also observe that most neurons become dead during the IBP training process, which could hurt the representation capability of the network. In this paper, we study the relationship between IBP and CROWN, and prove that CROWN is always tighter than IBP when choosing appropriate bounding lines. We further propose a relaxed version of CROWN, linear bound propagation (LBP), that can be used to verify large networks to obtain lower verified errors than IBP. We also design a new activation function, parameterized ramp function (ParamRamp), which has more diversity of neuron status than ReLU. We conduct extensive experiments on MNIST, CIFAR-10 and Tiny-ImageNet with ParamRamp activation and achieve state-of-the-art verified robustness. Code and the appendix are available at https://github.com/ZhaoyangLyu/VerifiablyRobustNN.
arXiv commentAccepted to CVPR 2021 (Oral)
References in corpus (13)
- Intriguing properties of neural networks
- Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples
- Theoretically Principled Trade-off between Robustness and Accuracy
- Provable defenses against adversarial examples via the convex outer adversarial polytope
- Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks
- Certified Defenses against Adversarial Examples
- Efficient Neural Network Robustness Certification with General Activation Functions
- Evaluating Robustness of Neural Networks with Mixed Integer Programming
- Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methods
- Efficient Formal Safety Analysis of Neural Networks
- A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networks
- Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond
- Training verified learners with learned verifiers