One-vs-the-Rest Loss to Focus on Important Samples in Adversarial Training
Not on the map. Why?
Abstract (arXiv)
This paper proposes a new loss function for adversarial training. Since adversarial training has difficulties, e.g., necessity of high model capacity, focusing on important data points by weighting cross-entropy loss has attracted much attention. However, they are vulnerable to sophisticated attacks, e.g., Auto-Attack. This paper experimentally reveals that the cause of their vulnerability is their small margins between logits for the true label and the other labels. Since neural networks classify the data points based on the logits, logit margins should be large enough to avoid flipping the largest logit by the attacks. Importance-aware methods do not increase logit margins of important samples but decrease those of less-important samples compared with cross-entropy loss. To increase logit margins of important samples, we propose switching one-vs-the-rest loss (SOVR), which switches from cross-entropy to one-vs-the-rest loss for important samples that have small logit margins. We prove that one-vs-the-rest loss increases logit margins two times larger than the weighted cross-entropy loss for a simple problem. We experimentally confirm that SOVR increases logit margins of important samples unlike existing methods and achieves better robustness against Auto-Attack than importance-aware methods.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 21 Jul 2022.
Builds on
34 of 47 references.
References · 34
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Wide Residual Networkscited by 3,057
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 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
- 2016Adversarial Machine Learning at Scalecited by 934
22 more
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
- 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 275
- 2020Attacks Which Do Not Kill Training Make Adversarial Learning Strongercited by 242
- 2021Improving Robustness using Generated Datacited by 233
- 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
- 2021Fixing Data Augmentation to Improve Adversarial Robustnesscited by 201
- 2020Geometry-aware Instance-reweighted Adversarial Trainingcited by 198
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
- 2018MMA Training: Direct Input Space Margin Maximization through Adversarial Trainingcited by 171
- 2020Exactly Computing the Local Lipschitz Constant of ReLU Networkscited by 102
- 2020Neural Mechanics: Symmetry and Broken Conservation Laws in Deep Learning Dynamicscited by 93
- 2021OVANet: One-vs-All Network for Universal Domain Adaptationcited by 92
- 2021Probabilistic Margins for Instance Reweighting in Adversarial Trainingcited by 57
- 2021Exploring Memorization in Adversarial Trainingcited by 55
- 2020How benign is benign overfitting?cited by 40
- 2021Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neuronscited by 40
- 2022Self-Ensemble Adversarial Training for Improved Robustnesscited by 38
- 2021Continuous vs. Discrete Optimization of Deep Neural Networkscited by 34
- 2020Revisiting One-vs-All Classifiers for Predictive Uncertainty and Out-of-Distribution Detection in Neural Networkscited by 31
- 2021Evaluating the Robustness of Geometry-Aware Instance-Reweighted Adversarial Trainingcited by 12
Built on by
Citing papers per year: 2023: 3; 2024: 2; 2025: 1; 2026: 1.
7 papers.
- 2023Teaching Language Models to Self-Improve through Interactive Demonstrationscited by 26
- 2023Defenses in Adversarial Machine Learning: A Surveycited by 14
- 2024New Paradigm of Adversarial Training: Releasing Accuracy-Robustness Trade-Off via Dummy Classcited by 2
- 2025Failure Cases Are Better Learned But Boundary Says Sorry: Facilitating Smooth Perception Change for Accuracy-Robustness Trade-Off in Adversarial Trainingcited by 2
- 2024Feature compression is the root cause of adversarial fragility in neural network classifierscited by 1
- 2023Releasing Inequality Phenomenon in ℓ∞-norm Adversarial Training via Input Gradient Distillationcited by 0
- 2026Robust Alignment: Harmonizing Clean Accuracy and Adversarial Robustness in Adversarial Trainingcited by 0
- 2026Robust Alignment: Harmonizing Clean Accuracy and Adversarial Robustness in Adversarial Training29 Apr 2026
- 2025Failure Cases Are Better Learned But Boundary Says Sorry: Facilitating Smooth Perception Change for Accuracy-Robustness Trade-Off in Adversarial Training4 Aug 2025
- 2024New Paradigm of Adversarial Training: Releasing Accuracy-Robustness Trade-Off via Dummy Class16 Oct 2024
- 2024Feature compression is the root cause of adversarial fragility in neural network classifiers23 Jun 2024
- 2023Defenses in Adversarial Machine Learning: A Survey13 Dec 2023
- 2023Teaching Language Models to Self-Improve through Interactive Demonstrations20 Oct 2023
- 2023Releasing Inequality Phenomenon in ℓ∞-norm Adversarial Training via Input Gradient Distillation16 May 2023