Interpreting Adversarial Robustness: A View from Decision Surface in Input Space
Not on the map. Why?
Abstract (arXiv)
One popular hypothesis of neural network generalization is that the flat local minima of loss surface in parameter space leads to good generalization. However, we demonstrate that loss surface in parameter space has no obvious relationship with generalization, especially under adversarial settings. Through visualizing decision surfaces in both parameter space and input space, we instead show that the geometry property of decision surface in input space correlates well with the adversarial robustness. We then propose an adversarial robustness indicator, which can evaluate a neural network's intrinsic robustness property without testing its accuracy under adversarial attacks. Guided by it, we further propose our robust training method. Without involving adversarial training, our method could enhance network's intrinsic adversarial robustness against various adversarial attacks.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 2; 2024: 1; 2025: 0; 2026: 1.
10 papers.
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 210
- 2021Relating Adversarially Robust Generalization to Flat Minimacited by 57
- 2023Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learningcited by 20
- 2022Adversarial Rademacher Complexity of Deep Neural Networkscited by 18
- 2022Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classificationcited by 15
- 2021Domain Invariant Adversarial Learningcited by 7
- 2024A Curious Case of Searching for the Correlation between Training Data and Adversarial Robustness of Transformer Textual Modelscited by 5
- 2022Why Adversarial Training of ReLU Networks Is Difficult?cited by 4
- 2022Adaptive-Gravity: A Defense Against Adversarial Samplescited by 2
- 2026Quadratic Upper Bound for Boosting Robustnesscited by 0
- 2026Quadratic Upper Bound for Boosting Robustness20 Jan 2026
- 2024A Curious Case of Searching for the Correlation between Training Data and Adversarial Robustness of Transformer Textual Models18 Feb 2024
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applications14 Apr 2023
- 2023Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learning2 Mar 2023
- 2022Adversarial Rademacher Complexity of Deep Neural Networks27 Nov 2022
- 2022Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classification18 Jun 2022
- 2022Why Adversarial Training of ReLU Networks Is Difficult?30 May 2022
- 2022Adaptive-Gravity: A Defense Against Adversarial Samples7 Apr 2022
- 2021Relating Adversarially Robust Generalization to Flat Minima9 Apr 2021
- 2021Domain Invariant Adversarial Learning1 Apr 2021