ε-weakened Robustness of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
This paper introduces a notation of varepsilon-weakened robustness for analyzing the reliability and stability of deep neural networks (DNNs). Unlike the conventional robustness, which focuses on the "perfect" safe region in the absence of adversarial examples, varepsilon-weakened robustness focuses on the region where the proportion of adversarial examples is bounded by user-specified varepsilon. Smaller varepsilon means a smaller chance of failure. Under such robustness definition, we can give conclusive results for the regions where conventional robustness ignores. We prove that the varepsilon-weakened robustness decision problem is PP-complete and give a statistical decision algorithm with user-controllable error bound. Furthermore, we derive an algorithm to find the maximum varepsilon-weakened robustness radius. The time complexity of our algorithms is polynomial in the dimension and size of the network. So, they are scalable to large real-world networks. Besides, We also show its potential application in analyzing quality issues.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 33 of its 58 references that are in the map. First posted on arXiv 29 Oct 2021.
Builds on
33 of 58 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2020Designing Network Design Spacescited by 954
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
21 more
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2019Adversarial Training for Free!cited by 638
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
- 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 280
- 2016Safety Verification of Deep Neural Networkscited by 262
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
- 2018Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approachcited by 181
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
- 2018Disentangling Adversarial Robustness and Generalizationcited by 171
- 2017EAD: Elastic-Net Attacks to Deep Neural Networks via Adversarial Examplescited by 154
- 2017Dual Path Networkscited by 119
- 2018Reachability Analysis of Deep Neural Networks with Provable Guaranteescited by 93
- 2019Quantitative Verification of Neural Networks And its Security Applicationscited by 56
- 2020Curse of Dimensionality on Randomized Smoothing for Certifiable Robustnesscited by 56
- 2018A Statistical Approach to Assessing Neural Network Robustnesscited by 54
- 2019Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothingcited by 54
- 2020Extensions and limitations of randomized smoothing for robustness guaranteescited by 15
- 2021Attack as Defense: Characterizing Adversarial Examples using Robustnesscited by 14
- 2013A Fast and Practical Method to Estimate Volumes of Convex Polytopescited by 2
Built on by
Citing papers per year: 2022: 3; 2023: 3; 2024: 2.
8 papers.
- 2022Accurate Fairness: Improving Individual Fairness without Trading Accuracycited by 16
- 2023How adversarial attacks can disrupt seemingly stable accurate classifierscited by 4
- 2023A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximationcited by 2
- 2024A Survey of Neural Network Robustness Assessment in Image Recognitioncited by 2
- 2022Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zonecited by 1
- 2023Topology-preserving Adversarial Training for Alleviating Natural Accuracy Degradationcited by 1
- 2022DualApp: Tight Over-Approximation for Neural Network Robustness Verification via Under-Approximationcited by 0
- 2024Patch Synthesis for Property Repair of Deep Neural Networkscited by 0
- 2024A Survey of Neural Network Robustness Assessment in Image Recognition12 Apr 2024
- 2024Patch Synthesis for Property Repair of Deep Neural Networks2 Apr 2024
- 2023Topology-preserving Adversarial Training for Alleviating Natural Accuracy Degradation29 Nov 2023
- 2023How adversarial attacks can disrupt seemingly stable accurate classifiers7 Sep 2023
- 2023A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximation26 May 2023
- 2022DualApp: Tight Over-Approximation for Neural Network Robustness Verification via Under-Approximation21 Nov 2022
- 2022Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone13 Nov 2022
- 2022Accurate Fairness: Improving Individual Fairness without Trading Accuracy18 May 2022