The reviewed record of science sign in
Pith

arxiv: 2309.16223 · v2 · pith:JHQG7ZHL · submitted 2023-09-28 · cs.AI · cs.LG

GInX-Eval: Towards In-Distribution Evaluation of Graph Neural Network Explanations

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JHQG7ZHLrecord.jsonopen to challenge →

classification cs.AI cs.LG
keywords evaluationexplanationsgraphedgesginx-evalmethodsmodelfaithfulness
0
0 comments X
read the original abstract

Diverse explainability methods of graph neural networks (GNN) have recently been developed to highlight the edges and nodes in the graph that contribute the most to the model predictions. However, it is not clear yet how to evaluate the correctness of those explanations, whether it is from a human or a model perspective. One unaddressed bottleneck in the current evaluation procedure is the problem of out-of-distribution explanations, whose distribution differs from those of the training data. This important issue affects existing evaluation metrics such as the popular faithfulness or fidelity score. In this paper, we show the limitations of faithfulness metrics. We propose GInX-Eval (Graph In-distribution eXplanation Evaluation), an evaluation procedure of graph explanations that overcomes the pitfalls of faithfulness and offers new insights on explainability methods. Using a fine-tuning strategy, the GInX score measures how informative removed edges are for the model and the EdgeRank score evaluates if explanatory edges are correctly ordered by their importance. GInX-Eval verifies if ground-truth explanations are instructive to the GNN model. In addition, it shows that many popular methods, including gradient-based methods, produce explanations that are not better than a random designation of edges as important subgraphs, challenging the findings of current works in the area. Results with GInX-Eval are consistent across multiple datasets and align with human evaluation.

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 1 Pith paper

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

  1. Beyond Soft Masks: Hard-Perturbation Mixup Explainer for Robust GNN Explainability

    cs.LG 2026-06 unverdicted novelty 6.0

    HPME proposes hard-perturbation mixup explainer grounded in generalized Graph Information Bottleneck to extract discrete subgraphs and generate in-distribution explanations that outperform soft-mask approaches on synt...