Pith. sign in

REVIEW 2 cited by

Explainability in Graph Neural Networks: A Taxonomic Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.15445 v3 pith:FHHPJC3M submitted 2020-12-31 cs.LG cs.AI

classification cs.LGcs.AI
keywords explainabilitygraphmethodsunifieddeepevaluationstaxonomicarea
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning methods are achieving ever-increasing performance on many artificial intelligence tasks. A major limitation of deep models is that they are not amenable to interpretability. This limitation can be circumvented by developing post hoc techniques to explain the predictions, giving rise to the area of explainability. Recently, explainability of deep models on images and texts has achieved significant progress. In the area of graph data, graph neural networks (GNNs) and their explainability are experiencing rapid developments. However, there is neither a unified treatment of GNN explainability methods, nor a standard benchmark and testbed for evaluations. In this survey, we provide a unified and taxonomic view of current GNN explainability methods. Our unified and taxonomic treatments of this subject shed lights on the commonalities and differences of existing methods and set the stage for further methodological developments. To facilitate evaluations, we generate a set of benchmark graph datasets specifically for GNN explainability. We summarize current datasets and metrics for evaluating GNN explainability. Altogether, this work provides a unified methodological treatment of GNN explainability and a standardized testbed for evaluations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ReconXF: Graph Reconstruction Attack via Public Feature Explanations on Privatized Node Features and Labels

    cs.LG 2025-06 conditional novelty 5.0 of 10

    ReconXF reconstructs graph structure from public feature explanations and differentially private node features and labels, outperforming prior attacks on Cora and Citeseer.

  2. Learning Causality for Modern Machine Learning

    cs.LG 2025-06 conditional novelty 2.0 of 10

    A thesis compiling six papers that use causal invariance to improve graph neural networks' out-of-distribution generalization, interpretability, and robustness.

Pith tools