BetaExplainer: A Probabilistic Method to Explain Graph Neural Networks

Whitney Sloneker, Shalin Patel, Michael Wang, Lorin Crawford, Ritambhara Singh
12/16/2024
stat.MLcs.LG

No official code found. Best implementation: wsloneker/BetaExplainerDemo (0 stars, last commit 2025-06-06).

Abstract

Graph neural networks (GNNs) are powerful tools for conducting inference on graph data but are often seen as "black boxes" due to difficulty in extracting meaningful subnetworks driving predictive performance. Many interpretable GNN methods exist, but they cannot quantify uncertainty in edge weights and suffer in predictive accuracy when applied to challenging graph structures. In this work, we proposed BetaExplainer which addresses these issues by using a sparsity-inducing prior to mask unimportant edges during model training. To evaluate our approach, we examine various simulated data sets with diverse real-world characteristics. Not only does this implementation provide a notion of edge importance uncertainty, it also improves upon evaluation metrics for challenging datasets compared to state-of-the art explainer methods.

View on arXivView PDF

Code Implementations(1)

00HTML, PythonJun 20, 20241 years ago

Similar Papers

Cite this paper

@article{sloneker2024betaexplainer,
  title  = {BetaExplainer: A Probabilistic Method to Explain Graph Neural Networks},
  author = {Whitney Sloneker and Shalin Patel and Michael Wang and Lorin Crawford and Ritambhara Singh},
  year   = {2024},
  eprint = {2412.11964},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.11964v1}
}

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

Discussion