Safety, alignment & interpretability· 2013
Intriguing properties of neural networks
Small changes transfer.
On the reading lists
- #4 in the Top 500 (2026 edition)
- #4 of 100 papers to read in your lifetime (2026 edition)
- #1 in Safety, alignment & interpretability (2026 edition)
Why it matters
Discovered imperceptible adversarial perturbations and their surprising transferability across neural networks.
Condensed from the expert lists' notes.
Inside the paper
- The problem
- Neural networks performed well on image recognition, but it was difficult to understand what their hidden units represented or how their predictions behaved near familiar images.
- The idea
- The authors examine both questions directly: compare individual units with combinations of units, then search for small input changes that produce a chosen wrong prediction.
- How it works
- For a held-out set, collect images that strongly activate one hidden unit, and compare them with images activating a random direction in the same representation.
- To seek a misleading image, choose a target label and optimize a perturbation while keeping the resulting pixels within their allowed range.
- The optimization trades off the size of the change against loss for the target label, using a constrained numerical procedure to approximate the solution.
- The authors test the resulting images on other networks, including models trained with different settings or disjoint subsets of the training data.
- What it showed
- Both individual units and random directions produced groups of visually related images. The optimized changes fooled the source models, and a substantial fraction also fooled other models in the experiments.
- Read it for
- Start with Section 3 and Figures 1–4 for the representation comparison, then read Section 4.1 and Figure 5 for the perturbation experiment. The later mathematical bounds can be skimmed on a first pass.
Written in our own words from the paper itself. A draft the editors have not yet reviewed.
Reading it
Difficulty: Intermediate
Read this first: neural network basics (backpropagation); convolutional networks (LeNet).
The record
- First released
- 2013 (from arXiv 1312.6199)
- Published
- 2014
- Citations
- 17,244 citations, as counted by
Semantic Scholar (non-commercial licence) - Awards
- ICLR Test of Time
- Named by
- both expert lists
- Score
- 0.915 · computed rank 4 · consensus 0.97, must-read 1, citations percentile 0.926 (2010s · safety), awards 1, existing lists 0.5. Method
Editor's notes
- Readability check: pass: Readable discovery of adversarial examples, a lasting lesson about what networks learn. (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), and
Semantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.