Verifying Relational Explanations: A Probabilistic Approach

Abisha Thapa Magar, Anup Shakya, Somdeb Sarkhel, Deepak Venugopal
1/5/2024
cs.AI

No confident code implementation found for this paper.

Abstract

Explanations on relational data are hard to verify since the explanation structures are more complex (e.g. graphs). To verify interpretable explanations (e.g. explanations of predictions made in images, text, etc.), typically human subjects are used since it does not necessarily require a lot of expertise. However, to verify the quality of a relational explanation requires expertise and is hard to scale-up. GNNExplainer is arguably one of the most popular explanation methods for Graph Neural Networks. In this paper, we develop an approach where we assess the uncertainty in explanations generated by GNNExplainer. Specifically, we ask the explainer to generate explanations for several counterfactual examples. We generate these examples as symmetric approximations of the relational structure in the original data. From these explanations, we learn a factor graph model to quantify uncertainty in an explanation. Our results on several datasets show that our approach can help verify explanations from GNNExplainer by reliably estimating the uncertainty of a relation specified in the explanation.

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{magar2024verifying,
  title  = {Verifying Relational Explanations: A Probabilistic Approach},
  author = {Abisha Thapa Magar and Anup Shakya and Somdeb Sarkhel and Deepak Venugopal},
  year   = {2024},
  eprint = {2401.02703},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.02703v1}
}

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/2401.02703.svg)](https://codeofpaper.com/paper/2401.02703)

Discussion