mlsanityData to 14 Oct 2026

Catastrophic Overfitting, Entropy Gap and Participation Ratio: A Noiseless lp Norm Solution for Fast Adversarial Training

arXiv 2505.02360 ↗First posted 5 May 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Adversarial training is a cornerstone of robust deep learning, but fast methods like the Fast Gradient Sign Method (FGSM) often suffer from Catastrophic Overfitting (CO), where models become robust to single-step attacks but fail against multi-step variants. While existing solutions rely on noise injection, regularization, or gradient clipping, we propose a novel solution that purely controls the lp training norm to mitigate CO. Our study is motivated by the empirical observation that CO is more prevalent under the l∞ norm than the l2 norm. Leveraging this insight, we develop a framework for generalized lp attack as a fixed point problem and craft lp-FGSM attacks to understand the transition mechanics from l2 to l∞. This leads to our core insight: CO emerges when highly concentrated gradients where information localizes in few dimensions interact with aggressive norm constraints. By quantifying gradient concentration through Participation Ratio and entropy measures, we develop an adaptive lp-FGSM that automatically tunes the training norm based on gradient information. Extensive experiments demonstrate that this approach achieves strong robustness without requiring additional regularization or noise injection, providing a novel and theoretically-principled pathway to mitigate the CO problem.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 50 references that are in the map. First posted on arXiv 5 May 2025.

Builds on

26 of 50 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  5. 2013Intriguing properties of neural networkscited by 5,155
  6. 2016Gaussian Error Linear Units (GELUs)cited by 3,502
  7. 2016Wide Residual Networkscited by 3,070
  8. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  9. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  10. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  11. 2020Fast is better than free: Revisiting adversarial trainingcited by 727
  12. 2019Adversarial Training for Free!cited by 643
14 more
  1. 2017Self-Normalizing Neural Networkscited by 598
  2. 2020Overfitting in adversarially robust deep learningcited by 506
  3. 2020Understanding and Improving Fast Adversarial Trainingcited by 214
  4. 2019Adversarial Robustness through Local Linearizationcited by 146
  5. 2016Robustness of classifiers: from adversarial to random noisecited by 88
  6. 2020Understanding Catastrophic Overfitting in Single-step Adversarial Trainingcited by 76
  7. 2022Make Some Noise: Reliable and Efficient Single-Step Adversarial Trainingcited by 43
  8. 2021Adversarial Attacks on Deep Models for Financial Transaction Recordscited by 24
  9. 2022Efficiently Training Low-Curvature Neural Networkscited by 19
  10. 2021ZeroGrad : Mitigating and Explaining Catastrophic Overfitting in FGSM Adversarial Trainingcited by 15
  11. 2020Adversarial Attacks on Machine Learning Systems for High-Frequency Tradingcited by 11
  12. 2023PAC-Bayesian Spectrally-Normalized Bounds for Adversarially Robust Generalizationcited by 9
  13. 2023Adversarial Machine Learning for Social Good: Reframing the Adversary as an Allycited by 6
  14. 2024Urban traffic analysis and forecasting through shared Koopman eigenmodescited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.