Fast and Stable Interval Bounds Propagation for Training Verifiably Robust Models
arXiv:1906.00628
Abstract
We present an efficient technique, which allows to train classification networks which are verifiably robust against norm-bounded adversarial attacks. This framework is built upon the work of Gowal et al., who applies the interval arithmetic to bound the activations at each layer and keeps the prediction invariant to the input perturbation. While that method is faster than competitive approaches, it requires careful tuning of hyper-parameters and a large number of epochs to converge. To speed up and stabilize training, we supply the cost function with an additional term, which encourages the model to keep the interval bounds at hidden layers small. Experimental results demonstrate that we can achieve comparable (or even better) results using a smaller number of training iterations, in a more stable fashion. Moreover, the proposed model is not so sensitive to the exact specification of the training process, which makes it easier to use by practitioners.
References in corpus (12)
- Towards Deep Learning Models Resistant to Adversarial Attacks
- Evaluating Robustness of Neural Networks with Mixed Integer Programming
- On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models
- An approach to reachability analysis for feed-forward ReLU neural networks
- Generating Adversarial Examples with Adversarial Networks
- DARTS: Deceiving Autonomous Cars with Toxic Signs
- A Unified View of Piecewise Linear Neural Network Verification
- Training for Faster Adversarial Robustness Verification via Inducing ReLU Stability
- Provably Minimally-Distorted Adversarial Examples
- Training verified learners with learned verifiers
- A Provable Defense for Deep Residual Networks
- On Certifying Non-uniform Bound against Adversarial Attacks