Safety, alignment & interpretability· 2014
Explaining and Harnessing Adversarial Examples
Step along gradient signs.
On the reading lists
- #43 in the Top 500 (2026 edition)
- #34 of 100 papers to read in your lifetime (2026 edition)
- #4 in Safety, alignment & interpretability (2026 edition)
Why it matters
Introduced FGSM and a foundational explanation of adversarial vulnerability in neural networks.
Condensed from the expert lists' notes.
Inside the paper
- The problem
- Image classifiers could be fooled by small, deliberately chosen input changes, but the reason such examples existed and worked across models was contested.
- The idea
- The authors argue that approximately linear behavior in high dimensions can add many small input changes into a large change in a model’s response. They also use such changes during training.
- How it works
- For a given example, calculate the gradient of the training loss with respect to its input, holding the model parameters fixed.
- Change each input coordinate in the direction indicated by the sign of its gradient, with a fixed bound on the size of each change.
- Add these altered examples to the training objective alongside ordinary examples, so the network learns from inputs chosen to increase its loss.
- Compare this procedure with alternatives including random input noise, and examine examples made for one model on other models.
- What it showed
- On MNIST, adversarial training reduced error on examples generated by the tested gradient-sign attack, though errors remained. The paper also found that a generative model and an ensemble were vulnerable in its experiments.
- Read it for
- Read Sections 3 and 4 for the linear argument and attack, then Section 6 for the training experiment. Figure 1 gives a visual example; Sections 7–9 explore alternative explanations and can follow later.
Written in our own words from the paper itself. A draft the editors have not yet reviewed.
Reading it
Difficulty: Intermediate
Read this first: Intriguing properties of neural networks.
The record
- First released
- 2014 (from arXiv 1412.6572)
- Published
- 2015
- Citations
- 23,382 citations, as counted by Papers With Code (CC BY-SA 4.0)
- Named by
- both expert lists
- Score
- 0.730 · computed rank 43 · consensus 0.97, must-read 1, citations percentile 0.968 (2010s · safety), awards 0, existing lists 0. Method
Editor's notes
- Readability check: pass: Short and intuitive account of why adversarial examples exist. (AI draft (Claude), not yet reviewed, 2026-10-29)
Data sources
Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.