GraphSVX: Shapley Value Explanations for Graph Neural Networks

Alexandre Duval, Fragkiskos D. Malliaros

Main figure for GraphSVX: Shapley Value Explanations for Graph Neural Networks

Abstract

Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data due to the incorporation of graph structure into the learning of node representations, which renders their comprehension challenging. In this paper, we first propose a unified framework satisfied by most existing GNN explainers. Then, we introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs. GraphSVX is a decomposition technique that captures the ``fair'' contribution of each feature and node towards the explained prediction by constructing a surrogate model on a perturbed dataset. It extends to graphs and ultimately provides as explanation the Shapley Values from game theory. Experiments on real-world and synthetic datasets demonstrate that GraphSVX achieves state-of-the-art performance compared to baseline models while presenting core theoretical and human-centric properties.

Proposed method: GraphSVX

Benchmark Results

Tested on 1 dataset 1 baseline value reported too low

Tables show presented results in global context (best 3 papers + GCN + MLP).

TU Dortmund

#ModelAccuracy ↑Paper
1
MSH-GNN
0.9910 ±0.0030
2
ID-GNN+BEC
0.9830 ±0.0360
3
SupCosine
0.9830 ±0.0250
39
GIN
0.9330 ±0.0290
331
GNNExplainer
actual #331 vs paper #781 450 places worse
0.8800 ±0.0300
best reported
actual #331 vs paper #781 450 places worse
paper 0.6500
393
PGExplainer
actual #393 vs paper #645 252 places worse
0.8700 ±0.0300
best reported
actual #393 vs paper #645 252 places worse
paper 0.7900
403
MLP
0.8660 ±0.0495
683
GraphSVX
0.7700
This paper
751
PGM-Explainer
0.7200
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green) Best today — OK at publication; today's leaderboard best is elsewhere