arrow
Return

Explaining the Explainers in Graph Neural Networks: a Comparative Study

delete2025-01-09
delete1
delete
OA
AI
A
Antonio Longa
S
Steve Azzolin
G
Gabriele Santin
G
Giulia Cencetti
P
Píetro Lió
B
Bruno Lepri
A
Andrea Passerini
DOI:10.1145/3696444delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Following a fast initial breakthrough in graph-based learning, Graph Neural Networks (GNNs) have reached a widespread application in many science and engineering fields, prompting the need for methods to understand their decision process. GNN explainers have started to emerge in recent years, with a multitude of methods both novel or adapted from other domains. To sort out this plethora of alternative approaches, several studies have benchmarked the performance of different explainers in terms of various explainability metrics. However, these earlier works make no attempts at providing insights into why different GNN architectures are more or less explainable or which explainer should be preferred in a given setting. In this survey we fill these gaps by devising a systematic experimental study, which tests 12 explainers on eight representative message-passing architectures trained on six carefully designed graph and node classification datasets. With our results we provide key insights on the choice and applicability of GNN explainers, we isolate key components that make them usable and successful and provide recommendations on how to avoid common interpretation pitfalls. We conclude by highlighting open questions and directions of possible future research.
Keywords:
Explainability
graph neural networks

Journal

ACM Computing Surveys cover
ACM Computing Surveys
IF:
28
Papers:
2.4K
Citations:
3.5W

Organization

F
Fdn Bruno Kessler
Scholars:
64
Papers: 27
Citations: 5
U
Univ Trento
Scholars:
519
Papers: 303
Citations: 94
U
Univ Cambridge
Scholars:
3.2K
Papers: 1.8K
Citations: 974
researcher View more organizations