Interpretability / Methods
verifiedFeature Attribution
Which parts of the input were responsible for this output? Attribution methods answer with one number per input feature, and they are the oldest and most used family in interpretability. They are also the most easily misread: a heatmap over pixels or tokens looks like an explanation whether or not it is one.
Gradient-times-input is the cheap version and is noisy. Integrated gradients accumulates gradients along a path from a baseline, which buys axioms — completeness and sensitivity — at the price of choosing that baseline, a modelling decision people routinely skip. Sanity checks matter here more than anywhere else: some published saliency maps survive randomising the model's own weights, which means they were showing edges in the image rather than anything the model did.
IG sub i = (x sub i − x′ sub i )·∫ ∂F(x′ + α(x − x′))/∂x sub i dα over α from 0 to 1, approximated by a Riemann sum of 20 to 300 steps. Completeness says the attributions sum to F(x) − F(x′), which is exactly why the baseline x′ is not a detail: it decides what the explanation is relative to.
16 values. The left group decays steeply; the right group is 15% of the way to flat, and reads flatter than the left.
Attribution mass across input tokens, raw and after averaging over noisy copies of the input. Drag the smoothing up to watch the spikes spread into their neighbours — calmer to look at, and no longer pointing at one token.
Reviewed by opendroid · 2026-08-18
- arXiv:1703.01365 — Axiomatic Attribution for Deep Networks
- arXiv:1706.03825 — SmoothGrad: removing noise by adding noise
- arXiv:1810.03292 — Sanity Checks for Saliency Maps