Adversarial Examples Exist in Two-Layer ReLU Networks for Low Dimensional Linear Subspaces
Not on the map. Why?
Abstract (arXiv)
Despite a great deal of research, it is still not well-understood why trained neural networks are highly vulnerable to adversarial examples. In this work we focus on two-layer neural networks trained using data which lie on a low dimensional linear subspace. We show that standard gradient methods lead to non-robust neural networks, namely, networks which have large gradients in directions orthogonal to the data subspace, and are susceptible to small adversarial L2-perturbations in these directions. Moreover, we show that decreasing the initialization scale of the training algorithm, or adding L2 regularization, can make the trained network more robust to adversarial perturbations orthogonal to the data.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 36 of its 39 references that are in the map. First posted on arXiv 1 Mar 2023.
Builds on
36 of 39 references.
References · 36
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2016Practical Black-Box Attacks against Machine Learningcited by 893
- 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 675
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 542
- 2018Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Modelscited by 362
24 more
- 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 349
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2019High Frequency Component Helps Explain the Generalization of Convolutional Neural Networkscited by 310
- 2017MagNet: a Two-Pronged Defense against Adversarial Examplescited by 268
- 2018Disentangling Adversarial Robustness and Generalizationcited by 171
- 2021A Universal Law of Robustness via Isoperimetrycited by 150
- 2022Reconstructing Training Data from Trained Neural Networkscited by 129
- 2018Are adversarial examples inevitable?cited by 113
- 2020Feature Purification: How Adversarial Training Performs Robust Deep Learningcited by 107
- 2018Adversarial examples from computational constraintscited by 79
- 2018Adversarial vulnerability for any classifiercited by 78
- 2016A Boundary Tilting Persepective on the Phenomenon of Adversarial Examplescited by 70
- 2020A law of robustness for two-layers neural networkscited by 54
- 2018On the Geometry of Adversarial Examplescited by 43
- 2021The Dimpled Manifold Model of Adversarial Examples in Machine Learningcited by 41
- 2017The Robust Manifold Defense: Adversarial Training using Generative Modelscited by 35
- 2019A Simple Explanation for the Existence of Adversarial Examples with Small Hamming Distancecited by 32
- 2022Gradient Methods Provably Converge to Non-Robust Networkscited by 27
- 2021A single gradient step finds adversarial examples on random two-layers neural networkscited by 26
- 2021Adversarial Examples in Multi-Layer Random ReLU Networkscited by 26
- 2021Shift Invariance Can Reduce Adversarial Robustnesscited by 16
- 2022Adversarial Examples in Random Neural Networks with General Activationscited by 13
- 2022On the (Non-)Robustness of Two-Layer Neural Networks in Different Learning Regimescited by 10
- 2022Adversarial Robustness is at Odds with Lazy Trainingcited by 6
Built on by
Citing papers per year: 2024: 2; 2025: 3; 2026: 3.
8 papers.
- 2025When Flatness Does (Not) Guarantee Adversarial Robustnesscited by 3
- 2025H-SPLID: HSIC-based Saliency Preserving Latent Information Decompositioncited by 2
- 2026From Curiosity to Caution: Mitigating Reward Hacking for Best-of-N with Pessimismcited by 2
- 2024Feature compression is the root cause of adversarial fragility in neural network classifierscited by 1
- 2024Adversarial Vulnerability as a Consequence of On-Manifold Inseparibilitycited by 0
- 2025Existence of Adversarial Examples for Random Convolutional Networks via Isoperimetric Inequalities on mathbbso(d)cited by 0
- 2026On the Rate of Convergence of GD in Non-linear Neural Networks: An Adversarial Robustness Perspectivecited by 0
- 2026Efficient Techniques for Data Reconstruction, with Finite-Width Recovery Guaranteescited by 0
- 2026Efficient Techniques for Data Reconstruction, with Finite-Width Recovery Guarantees7 May 2026
- 2026From Curiosity to Caution: Mitigating Reward Hacking for Best-of-N with Pessimism6 Apr 2026
- 2026On the Rate of Convergence of GD in Non-linear Neural Networks: An Adversarial Robustness Perspective2 Mar 2026
- 2025H-SPLID: HSIC-based Saliency Preserving Latent Information Decomposition23 Oct 2025
- 2025When Flatness Does (Not) Guarantee Adversarial Robustness16 Oct 2025
- 2025Existence of Adversarial Examples for Random Convolutional Networks via Isoperimetric Inequalities on mathbbso(d)14 Jun 2025
- 2024Adversarial Vulnerability as a Consequence of On-Manifold Inseparibility9 Oct 2024
- 2024Feature compression is the root cause of adversarial fragility in neural network classifiers23 Jun 2024