mlsanityData to 14 Oct 2026

The Uncanny Valley: Exploring Adversarial Robustness from a Flatness Perspective

arXiv 2405.16918 ↗First posted 27 May 2024cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Flatness of the loss surface not only correlates positively with generalization, but is also related to adversarial robustness since perturbations of inputs relate non-linearly to perturbations of weights. In this paper, we empirically analyze the relation between adversarial examples and relative flatness with respect to the parameters of one layer. We observe a peculiar property of adversarial examples in the context of relative flatness: during an iterative first-order white-box attack, the flatness of the loss surface measured around the adversarial example first becomes sharper until the label is flipped, but if we keep the attack running, it runs into a flat uncanny valley where the label remains flipped. In extensive experiments, we observe this phenomenon across various model architectures and datasets, even for adversarially trained models. Our results also extend to large language models (LLMs), but due to the discrete nature of the input space and comparatively weak attacks, adversarial examples rarely reach truly flat regions. Most importantly, this phenomenon shows that flatness alone cannot explain adversarial robustness unless we can also guarantee the behavior of the function around the examples. We, therefore theoretically connect relative flatness to adversarial robustness by bounding the third derivative of the loss surface, underlining the need for flatness in combination with a low global Lipschitz constant for a robust model.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 56 of its 70 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

56 of 70 references.

References · 56

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2016Densely Connected Convolutional Networkscited by 6,720
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  7. 2013Intriguing properties of neural networkscited by 5,155
  8. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  9. 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
  10. 2016Wide Residual Networkscited by 3,070
  11. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  12. 2023Jailbroken: How Does LLM Safety Training Fail?cited by 1,651
38 more
  1. 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
  2. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  3. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  4. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  5. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
  6. 2016Adversarial Machine Learning at Scalecited by 936
  7. 2018Robustness May Be at Odds with Accuracycited by 880
  8. 2017Ensemble Adversarial Training: Attacks and Defensescited by 840
  9. 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
  10. 2016Universal adversarial perturbationscited by 784
  11. 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 685
  12. 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 546
  13. 2017Adversarial Patchcited by 517
  14. 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 491
  15. 2017Feature Squeezing: Detecting Adversarial Examples in Deep Neural Networkscited by 486
  16. 2017Sharp Minima Can Generalize For Deep Netscited by 466
  17. 2019Unlabeled Data Improves Adversarial Robustnesscited by 416
  18. 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 415
  19. 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 330
  20. 2018Adversarially Robust Generalization Requires More Datacited by 318
  21. 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 314
  22. 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 282
  23. 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 195
  24. 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 185
  25. 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 100
  26. 2018Curriculum Adversarial Trainingcited by 89
  27. 2020Relative Flatness and Generalizationcited by 88
  28. 2018Universal Adversarial Trainingcited by 87
  29. 2023A Unified Algebraic Perspective on Lipschitz Neural Networkscited by 60
  30. 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 59
  31. 2021Relating Adversarially Robust Generalization to Flat Minimacited by 57
  32. 2021Mind the box: l1-APGD for sparse adversarial attacks on image classifierscited by 51
  33. 2019A New Defense Against Adversarial Images: Turning a Weakness into a Strengthcited by 49
  34. 2021Detecting Adversarial Examples Is (Nearly) As Hard As Classifying Themcited by 48
  35. 2022LGV: Boosting Adversarial Example Transferability from Large Geometric Vicinitycited by 39
  36. 2018ADef: an Iterative Algorithm to Construct Adversarial Deformationscited by 38
  37. 2019Harnessing the Vulnerability of Latent Layers in Adversarially Trained Modelscited by 26
  38. 2023Layer-wise Linear Mode Connectivitycited by 22

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.