Safety, alignment & interpretability· 2017
Axiomatic Attribution for Deep Networks
Accumulate gradients from baseline.
On the reading lists
- #72 in the Top 500 (2026 edition)
- #56 of 100 papers to read in your lifetime (2026 edition)
- #6 in Safety, alignment & interpretability (2026 edition)
Why it matters
Introduced principled attribution axioms and Integrated Gradients, a widely adopted gradient-based explanation method.
Condensed from the expert lists' notes.
Inside the paper
- The problem
- It is difficult to tell whether an explanation of a neural network prediction is misleading because of the explanation method or because of the model itself.
- The idea
- The authors start from properties they want an attribution method to satisfy, then construct an explanation by accumulating gradients between a reference input and the example being explained.
- How it works
- Choose a baseline input that represents the absence of the signal of interest, such as a black image for an image model.
- Move along the straight line from the baseline to the example, evaluating the model’s output gradient at points along that path.
- For each input feature, average its gradients along the path and multiply by the difference between its actual and baseline values.
- Approximate the integral with a finite sum, and check that the feature contributions approximately add up to the output difference from the baseline.
- What it showed
- The paper proves properties of the method, including its accounting of the output difference and invariance to equivalent implementations. It applies the method to image, text and chemistry networks, including examples used to investigate model behavior.
- Read it for
- Read Sections 2 and 3 for the axioms and construction, then Figure 2 and Section 6 for applications. Section 4’s uniqueness argument and its proofs can wait for a more mathematical reading.
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); gradients.
The record
- First released
- 2017 (from arXiv 1703.01365)
- Citations
- 9,010 citations, as counted by Papers With Code (CC BY-SA 4.0)
- Named by
- both expert lists
- Score
- 0.701 · computed rank 72 · consensus 0.96, must-read 1, citations percentile 0.894 (2010s · safety), awards 0, existing lists 0. Method
Editor's notes
- Readability check: pass: Integrated Gradients: short, with a clear axiomatic argument. (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.