Full-Gradient Representation for Neural Network Visualization

Suraj Srinivas, Francois Fleuret
5/2/2019
cs.LGcs.CVstat.ML

Official code: idiap/fullgrad-saliency (210 stars, last commit 2023-02-25).

Abstract

We introduce a new tool for interpreting neural net responses, namely full-gradients, which decomposes the neural net response into input sensitivity and per-neuron sensitivity components. This is the first proposed representation which satisfies two key properties: completeness and weak dependence, which provably cannot be satisfied by any saliency map-based interpretability method. For convolutional nets, we also propose an approximate saliency map representation, called FullGrad, obtained by aggregating the full-gradient components. We experimentally evaluate the usefulness of FullGrad in explaining model behaviour with two quantitative tests: pixel perturbation and remove-and-retrain. Our experiments reveal that our method explains model behaviour correctly, and more comprehensively than other methods in the literature. Visual inspection also reveals that our saliency maps are sharper and more tightly confined to object regions than other methods.

View on arXivView PDF

Code Implementations(1)

Full-gradient saliency maps

21031PythonOct 3, 20193 years agoNOASSERTION

Cite this paper

@article{srinivas2019fullgradient,
  title  = {Full-Gradient Representation for Neural Network Visualization},
  author = {Suraj Srinivas and Francois Fleuret},
  year   = {2019},
  eprint = {1905.00780},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1905.00780}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1905.00780.svg)](https://codeofpaper.com/paper/1905.00780)

Discussion