Pith. sign in

REVIEW 4 cited by

A Survey on Explainability of Graph Neural Networks

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 2306.01958 v1 pith:DGXNSAFF submitted 2023-06-02 cs.LG cs.AI

classification cs.LGcs.AI
keywords gnnsexplainabilitygraphmethodssurveyaimsexistinggraph-based
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Graph neural networks (GNNs) are powerful graph-based deep-learning models that have gained significant attention and demonstrated remarkable performance in various domains, including natural language processing, drug discovery, and recommendation systems. However, combining feature information and combinatorial graph structures has led to complex non-linear GNN models. Consequently, this has increased the challenges of understanding the workings of GNNs and the underlying reasons behind their predictions. To address this, numerous explainability methods have been proposed to shed light on the inner mechanism of the GNNs. Explainable GNNs improve their security and enhance trust in their recommendations. This survey aims to provide a comprehensive overview of the existing explainability techniques for GNNs. We create a novel taxonomy and hierarchy to categorize these methods based on their objective and methodology. We also discuss the strengths, limitations, and application scenarios of each category. Furthermore, we highlight the key evaluation metrics and datasets commonly used to assess the explainability of GNNs. This survey aims to assist researchers and practitioners in understanding the existing landscape of explainability methods, identifying gaps, and fostering further advancements in interpretable graph-based machine learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. NAEx: A Plug-and-Play Framework for Explaining Network Alignment

    cs.LG 2025-08 conditional novelty 6.0 of 10

    NAEx is a plug-and-play explainer that identifies the key subgraphs and features driving network alignment predictions, and it generalizes to new pairs without retraining.

  2. A Self-Explainable Heterogeneous GNN for Relational Deep Learning

    cs.LG 2024-11 conditional novelty 6.0 of 10

    MPS-GNN learns predictive meta-paths in relational databases using aggregate statistics over their occurrences, not just existence, and outperforms prior heterogeneous GNNs in experiments.

  3. MotifGPL: Motif-Enhanced Graph Prototype Learning for Deciphering Urban Social Segregation

    cs.AI 2024-12 reject novelty 4.0 of 10

    MotifGPL learns prototypes from Beijing's spatial and mobility graphs, extracts motif patterns per prototype, and uses them to classify segregation levels and rewire the urban graph.

  4. Geometric deep learning assists protein engineering. Opportunities and Challenges

    q-bio.QM 2025-06 conditional novelty 3.0 of 10

    A perspective synthesizing geometric deep learning applications in protein engineering and proposing an explainable, structure-aware design pipeline.

Pith tools