pith. sign in

arxiv: 1905.13686 · v1 · pith:3N6YMVXNnew · submitted 2019-05-31 · 💻 cs.LG · cs.AI· stat.ML

Explainability Techniques for Graph Convolutional Networks

classification 💻 cs.LG cs.AIstat.ML
keywords graphdecisionsexplainabilitynetworkstechniquesapplicationchemistryclasses
0
0 comments X
read the original abstract

Graph Networks are used to make decisions in potentially complex scenarios but it is usually not obvious how or why they made them. In this work, we study the explainability of Graph Network decisions using two main classes of techniques, gradient-based and decomposition-based, on a toy dataset and a chemistry task. Our study sets the ground for future development as well as application to real-world problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Aitchison Embeddings for Learning Compositional Graph Representations

    cs.LG 2026-05 unverdicted novelty 7.0

    Graph nodes are embedded as simplex compositions via ILR coordinates to yield intrinsically interpretable representations that preserve Aitchison geometry and enable subcompositional analysis.

  2. A method for the systematic generation of graph XAI benchmarks via Weisfeiler-Leman coloring

    cs.LG 2025-05 unverdicted novelty 7.0

    A systematic method leveraging Weisfeiler-Leman coloring to mine class-discriminating motifs as proxy explanations, enabling the creation of the OpenGraphXAI benchmark suite from real-world datasets.

  3. Estimating Subgraph Importance with Structural Prior Domain Knowledge

    cs.LG 2026-05 unverdicted novelty 6.0

    A label-free Group Lasso method estimates important subgraphs in pretrained GNNs by incorporating domain structural knowledge.

  4. From Model to Data (M2D): Shifting Complexity from GNNs to Graphs for Transparent Graph Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    M2D distillation augments input graphs with model-derived features and structure, letting simple student GNNs match teacher performance while exposing mechanisms such as attention and fairness directly in the data.

  5. TACENR: Task-Agnostic Contrastive Explanations for Node Representations

    cs.LG 2026-04 unverdicted novelty 6.0

    TACENR introduces a contrastive-learning method that identifies the most influential attribute, proximity, and structural features in node representations in a task-agnostic manner.

  6. Explaining the Explainers in Graph Neural Networks: a Comparative Study

    cs.LG 2022-10 unverdicted novelty 5.0

    Benchmark study of ten GNN explainers on eight architectures and six datasets that isolates usable components and issues practical recommendations.