How Faithful are Self-Explainable GNNs?

Marc Christiansen, Lea Villadsen, Zhiqiang Zhong, Stefano Teso, Davide Mottin
8/29/2023
cs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{christiansen2023faithful,
  title  = {How Faithful are Self-Explainable GNNs?},
  author = {Marc Christiansen and Lea Villadsen and Zhiqiang Zhong and Stefano Teso and Davide Mottin},
  year   = {2023},
  eprint = {2308.15096},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.15096v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.15096.svg)](https://codeofpaper.com/paper/2308.15096)

Discussion