Using the Path of Least Resistance to Explain Deep Networks
Sina Salek, Joseph Enguehard

TL;DR
This paper introduces Geodesic Integrated Gradients (GIG), a novel attribution method that uses model-induced Riemannian metrics and geodesic paths to improve the faithfulness of feature importance scores in deep networks.
Contribution
The paper proposes GIG, an innovative path-based attribution method that addresses flaws of straight-line paths by integrating along geodesics under a model-derived metric, and introduces the No-Cancellation Completeness axiom.
Findings
GIG produces more faithful attributions than existing methods.
Theoretical proof links NCC to geodesic paths under the model metric.
Empirical results on image data validate the effectiveness of GIG.
Abstract
Integrated Gradients (IG), a widely used axiomatic path-based attribution method, assigns importance scores to input features by integrating model gradients along a straight path from a baseline to the input. While effective in some cases, we show that straight paths can lead to flawed attributions. In this paper, we identify the cause of these misattributions and propose an alternative approach that equips the input space with a model-induced Riemannian metric (derived from the explained model's Jacobian) and computes attributions by integrating gradients along geodesics under this metric. We call this method Geodesic Integrated Gradients (GIG). To approximate geodesic paths, we introduce two techniques: a k-Nearest Neighbours-based approach for smaller models and a Stochastic Variational Inference-based method for larger ones. Additionally, we propose a new axiom, No-Cancellation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications
