Boosting Adversarial Training via Fisher-Rao Norm-based Regularization
Not on the map. Why?
Abstract (arXiv)
Adversarial training is extensively utilized to improve the adversarial robustness of deep neural networks. Yet, mitigating the degradation of standard generalization performance in adversarial-trained models remains an open problem. This paper attempts to resolve this issue through the lens of model complexity. First, We leverage the Fisher-Rao norm, a geometrically invariant metric for model complexity, to establish the non-trivial bounds of the Cross-Entropy Loss-based Rademacher complexity for a ReLU-activated Multi-Layer Perceptron. Then we generalize a complexity-related variable, which is sensitive to the changes in model width and the trade-off factors in adversarial training. Moreover, intensive empirical evidence validates that this variable highly correlates with the generalization gap of Cross-Entropy loss between adversarial-trained and standard-trained models, especially during the initial and final phases of the training process. Building upon this observation, we propose a novel regularization framework, called Logit-Oriented Adversarial Training (LOAT), which can mitigate the trade-off between robustness and accuracy while imposing only a negligible increase in computational overhead. Our extensive experiments demonstrate that the proposed regularization strategy can boost the performance of the prevalent adversarial training algorithms, including PGD-AT, TRADES, TRADES (LSE), MART, and DM-AT, across various network architectures. Our code will be available at https://github.com/TrustAI/LOAT.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 41 references that are in the map. First posted on arXiv 26 Mar 2024.
Builds on
29 of 41 references.
References · 29
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 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
- 2016End to End Learning for Self-Driving Carscited by 1,000
- 2018Robustness May Be at Odds with Accuracycited by 873
- 2020Overfitting in adversarially robust deep learningcited by 504
- 2018Certified Defenses against Adversarial Examplescited by 305
- 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
- 2023Better Diffusion Models Further Improve Adversarial Trainingcited by 207
- 2018Robustness via curvature regularization, and vice versacited by 174
17 more
- 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
- 2022Robustness and Accuracy Could Be Reconcilable by (Proper) Definitioncited by 109
- 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 99
- 2023A Survey of Safety and Trustworthiness of Large Language Models through the Lens of Verification and Validationcited by 91
- 2021Model Complexity of Deep Learning: A Surveycited by 64
- 2015A Unified Gradient Regularization Family for Adversarial Examplescited by 43
- 2017Artificial Intelligence and Statisticscited by 43
- 2022Enhancing Adversarial Training with Second-Order Statistics of Weightscited by 42
- 2019Adversarial Robustness May Be at Odds With Simplicitycited by 39
- 2021Adversarial Driving: Attacking End-to-End Autonomous Drivingcited by 19
- 2021Sparse Adversarial Video Attacks with Spatial Transformationscited by 11
- 2022DIMBA: Discretely Masked Black-Box Attack in Single Object Trackingcited by 11
- 2021Understanding Generalization in Adversarial Training via the Bias-Variance Decompositioncited by 10
- 2023Reachability Analysis of Neural Network Control Systemscited by 8
- 2022Certified Policy Smoothing for Cooperative Multi-Agent Reinforcement Learningcited by 7
- 2023ReRoGCRL: Representation-based Robustness in Goal-Conditioned Reinforcement Learningcited by 6
- 2022Understanding Adversarial Robustness of Vision Transformers via Cauchy Problemcited by 4
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 3.
7 papers.
- 2025Unsupervised Robust Domain Adaptation: Paradigm, Theory and Algorithmcited by 3
- 2026ProGRank: Probe-Gradient Reranking to Defend Dense-Retriever RAG from Corpus Poisoningcited by 2
- 2024Enhancing Adversarial Robustness through Multi-Objective Representation Learningcited by 0
- 2024Standard-Deviation-Inspired Regularization for Improving Adversarial Robustnesscited by 0
- 2025Sequential Difference Maximization: Generating Adversarial Examples via Multi-Stage Optimizationcited by 0
- 2026SDM: A Powerful Tool for Evaluating Model Robustnesscited by 0
- 2026Crossing the Margin Cliff: Toward Relearn-Robust LLM Unlearning via Margin Calibrationcited by 0
- 2026Crossing the Margin Cliff: Toward Relearn-Robust LLM Unlearning via Margin Calibration30 Jul 2026
- 2026SDM: A Powerful Tool for Evaluating Model Robustness19 May 2026
- 2026ProGRank: Probe-Gradient Reranking to Defend Dense-Retriever RAG from Corpus Poisoning24 Mar 2026
- 2025Unsupervised Robust Domain Adaptation: Paradigm, Theory and Algorithm14 Nov 2025
- 2025Sequential Difference Maximization: Generating Adversarial Examples via Multi-Stage Optimization31 Aug 2025
- 2024Standard-Deviation-Inspired Regularization for Improving Adversarial Robustness27 Dec 2024
- 2024Enhancing Adversarial Robustness through Multi-Objective Representation Learning2 Oct 2024