REVIEW 2 cited by
How Faithful are Self-Explainable GNNs?
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
Signed reviews
read the original abstract
Self-explainable deep neural networks are a recent class of models that can output ante-hoc local explanations that are faithful to the model's reasoning, and as such represent a step forward toward filling the gap between expressiveness and interpretability. Self-explainable graph neural networks (GNNs) aim at achieving the same in the context of graph data. This begs the question: do these models fulfill their implicit guarantees in terms of faithfulness? In this extended abstract, we analyze the faithfulness of several self-explainable GNNs using different measures of faithfulness, identify several limitations -- both in the models themselves and in the evaluation metrics -- and outline possible ways forward.
Forward citations
Cited by 2 Pith papers
-
Beyond Topological Self-Explainable GNNs: A Formal Explainability Perspective
Self-explainable GNNs provably optimize minimal explanations that match prime implicants only for motif-based tasks, and a dual-channel extension recovers better rules.
-
A Self-Explainable Heterogeneous GNN for Relational Deep Learning
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.
Discussion (0). Continue with ORCID to comment.