View-based Explanations for Graph Neural Networks

• URL: http://arxiv.org/abs/2401.02086v2
• Date: Mon, 8 Jan 2024 01:59:11 GMT
• Title: View-based Explanations for Graph Neural Networks
• Authors: Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, Yunjun Gao
• Abstract summary: We propose GVEX, a novel paradigm that generates Graph Views for EXplanation. We show that this strategy provides an approximation ratio of 1/2. Our second algorithm performs a single-pass to an input node stream in batches to incrementally maintain explanation views.
• Score: 27.19300566616961
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generating explanations for graph neural networks (GNNs) has been studied to understand their behavior in analytical tasks such as graph classification. Existing approaches aim to understand the overall results of GNNs rather than providing explanations for specific class labels of interest, and may return explanation structures that are hard to access, nor directly queryable.We propose GVEX, a novel paradigm that generates Graph Views for EXplanation. (1) We design a two-tier explanation structure called explanation views. An explanation view consists of a set of graph patterns and a set of induced explanation subgraphs. Given a database G of multiple graphs and a specific class label l assigned by a GNN-based classifier M, it concisely describes the fraction of G that best explains why l is assigned by M. (2) We propose quality measures and formulate an optimization problem to compute optimal explanation views for GNN explanation. We show that the problem is $\Sigma^2_P$-hard. (3) We present two algorithms. The first one follows an explain-and-summarize strategy that first generates high-quality explanation subgraphs which best explain GNNs in terms of feature influence maximization, and then performs a summarization step to generate patterns. We show that this strategy provides an approximation ratio of 1/2. Our second algorithm performs a single-pass to an input node stream in batches to incrementally maintain explanation views, having an anytime quality guarantee of 1/4 approximation. Using real-world benchmark data, we experimentally demonstrate the effectiveness, efficiency, and scalability of GVEX. Through case studies, we showcase the practical applications of GVEX.

Related papers

• Utilizing Description Logics for Global Explanations of Heterogeneous Graph Neural Networks [0.25782420501870296]
  We propose utilizing class expressions (CEs) from the field of description logic (DL) to explain classes with multiple sufficient explanations. Our approach explains heterogeneous graphs with different types of nodes using CEs in the EL description logic.
  arXiv  Detail & Related papers  (2024-05-21T10:07:29Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks [12.16789930553124]
  Prototype-bAsed GNN-Explainer (Page) is a novel model-level explanation method for graph classification. Page discovers a common subgraph pattern by iteratively searching for high matching nodes. Using six graph classification datasets, we demonstrate that PAGE qualitatively and quantitatively outperforms the state-of-the-art model-level explanation method.
  arXiv  Detail & Related papers  (2022-10-31T09:10:06Z)
• Faithful Explanations for Deep Graph Models [44.3056871040946]
  This paper studies faithful explanations for Graph Neural Networks (GNNs) It applies to existing explanation methods, including feature attributions and subgraph explanations. Third, we introduce emphk-hop Explanation with a Convolutional Core (KEC), a new explanation method that provably maximizes faithfulness to the original GNN.
  arXiv  Detail & Related papers  (2022-05-24T07:18:56Z)
• Towards Explanation for Unsupervised Graph-Level Representation Learning [108.31036962735911]
  Existing explanation methods focus on the supervised settings, eg, node classification and graph classification, while the explanation for unsupervised graph-level representation learning is still unexplored. In this paper, we advance the Information Bottleneck principle (IB) to tackle the proposed explanation problem for unsupervised graph representations, which leads to a novel principle, textitUnsupervised Subgraph Information Bottleneck (USIB) We also theoretically analyze the connection between graph representations and explanatory subgraphs on the label space, which reveals that the robustness of representations benefit the fidelity of explanatory subgraphs.
  arXiv  Detail & Related papers  (2022-05-20T02:50:15Z)
• Task-Agnostic Graph Explanations [50.17442349253348]
  Graph Neural Networks (GNNs) have emerged as powerful tools to encode graph structured data. Existing learning-based GNN explanation approaches are task-specific in training. We propose a Task-Agnostic GNN Explainer (TAGE) trained under self-supervision with no knowledge of downstream tasks.
  arXiv  Detail & Related papers  (2022-02-16T21:11:47Z)
• A Meta-Learning Approach for Training Explainable Graph Neural Networks [10.11960004698409]
  We propose a meta-learning framework for improving the level of explainability of a GNN directly at training time. Our framework jointly trains a model to solve the original task, e.g., node classification, and to provide easily processable outputs for downstream algorithms. Our model-agnostic approach can improve the explanations produced for different GNN architectures and use any instance-based explainer to drive this process.
  arXiv  Detail & Related papers  (2021-09-20T11:09:10Z)
• GraphSVX: Shapley Value Explanations for Graph Neural Networks [81.83769974301995]
  Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data. In this paper, we propose a unified framework satisfied by most existing GNN explainers. We introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs.
  arXiv  Detail & Related papers  (2021-04-18T10:40:37Z)
• Parameterized Explainer for Graph Neural Network [49.79917262156429]
  We propose PGExplainer, a parameterized explainer for Graph Neural Networks (GNNs) Compared to the existing work, PGExplainer has better generalization ability and can be utilized in an inductive setting easily. Experiments on both synthetic and real-life datasets show highly competitive performance with up to 24.7% relative improvement in AUC on explaining graph classification.
  arXiv  Detail & Related papers  (2020-11-09T17:15:03Z)
• Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning [63.97983530843762]
  Graph Neural Networks (GNNs) have achieved great success in graph representation learning. GNNs generate identical representations for graph substructures that may in fact be very different. More powerful GNNs, proposed recently by mimicking higher-order tests, are inefficient as they cannot sparsity of underlying graph structure. We propose Distance Depiction (DE) as a new class of graph representation learning.
  arXiv  Detail & Related papers  (2020-08-31T23:15:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.