Provable robustness against all adversarial -perturbations for
arXiv:1905.11213
Abstract
In recent years several adversarial attacks and defenses have been proposed. Often seemingly robust models turn out to be non-robust when more sophisticated attacks are used. One way out of this dilemma are provable robustness guarantees. While provably robust models for specific -perturbation models have been developed, we show that they do not come with any guarantee against other -perturbations. We propose a new regularization scheme, MMR-Universal, for ReLU networks which enforces robustness wrt - and -perturbations and show how that leads to the first provably robust models wrt any -norm for .
References in corpus (17)
- Adam: A Method for Stochastic Optimization
- Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
- Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples
- Provable defenses against adversarial examples via the convex outer adversarial polytope
- Towards Deep Neural Network Architectures Robust to Adversarial Examples
- Certified Defenses against Adversarial Examples
- Evaluating Robustness of Neural Networks with Mixed Integer Programming
- On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models
- Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulation
- Learning with a Strong Adversary
- Towards the first adversarially robust neural network model on MNIST
- Training for Faster Adversarial Robustness Verification via Inducing ReLU Stability
- Improving the Robustness of Deep Neural Networks via Stability Training
- Attacking the Madry Defense Model with -based Adversarial Examples
- Provable Robustness of ReLU networks via Maximization of Linear Regions
- Logit Pairing Methods Can Fool Gradient-Based Attacks
- Transfer of Adversarial Robustness Between Perturbation Types