Factorized Explainer for Graph Neural Networks

• URL: http://arxiv.org/abs/2312.05596v2
• Date: Wed, 7 Feb 2024 18:52:26 GMT
• Title: Factorized Explainer for Graph Neural Networks
• Authors: Rundong Huang, Farhad Shirani, Dongsheng Luo
• Abstract summary: Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. Post-hoc instance-level explanation methods have been proposed to understand GNN predictions. We introduce a novel factorized explanation model with theoretical performance guarantees.
• Score: 7.382632811417645
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. To open the black-box of these deep learning models, post-hoc instance-level explanation methods have been proposed to understand GNN predictions. These methods seek to discover substructures that explain the prediction behavior of a trained GNN. In this paper, we show analytically that for a large class of explanation tasks, conventional approaches, which are based on the principle of graph information bottleneck (GIB), admit trivial solutions that do not align with the notion of explainability. Instead, we argue that a modified GIB principle may be used to avoid the aforementioned trivial solutions. We further introduce a novel factorized explanation model with theoretical performance guarantees. The modified GIB is used to analyze the structural properties of the proposed factorized explainer. We conduct extensive experiments on both synthetic and real-world datasets to validate the effectiveness of our proposed factorized explainer.

Related papers

• Learning Invariant Representations of Graph Neural Networks via Cluster Generalization [58.68231635082891]
  Graph neural networks (GNNs) have become increasingly popular in modeling graph-structured data. In this paper, we experimentally find that the performance of GNNs drops significantly when the structure shift happens. We propose the Cluster Information Transfer (CIT) mechanism, which can learn invariant representations for GNNs.
  arXiv  Detail & Related papers  (2024-03-06T10:36:56Z)
• Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Graph Neural Networks [12.892400744247565]
  We develop a novel interpretable causal GNN framework that incorporates retrieval-based causal learning with Graph Information Bottleneck (GIB) theory. We achieve 32.71% higher precision on real-world explanation scenarios with diverse explanation types.
  arXiv  Detail & Related papers  (2024-02-07T09:57:39Z)
• MixupExplainer: Generalizing Explanations for Graph Neural Networks with Data Augmentation [6.307753856507624]
  Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. Post-hoc instance-level explanation methods have been proposed to understand GNN predictions. We shed light on the existence of the distribution shifting issue in existing methods, which affects explanation quality.
  arXiv  Detail & Related papers  (2023-07-15T15:46:38Z)
• 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)
• Structural Explanations for Graph Neural Networks using HSIC [21.929646888419914]
  Graph neural networks (GNNs) are a type of neural model that tackle graphical tasks in an end-to-end manner. The complicated dynamics of GNNs make it difficult to understand which parts of the graph features contribute more strongly to the predictions. In this study, a flexible model agnostic explanation method is proposed to detect significant structures in graphs.
  arXiv  Detail & Related papers  (2023-02-04T09:46:47Z)
• Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Sampling [83.77955213766896]
  Graph convolutional networks (GCNs) have recently achieved great empirical success in learning graphstructured data. To address its scalability issue, graph topology sampling has been proposed to reduce the memory and computational cost of training Gs. This paper provides first theoretical justification of graph topology sampling in training (up to) three-layer GCNs.
  arXiv  Detail & Related papers  (2022-07-07T21:25:55Z)
• 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)
• Towards the Explanation of Graph Neural Networks in Digital Pathology with Information Flows [67.23405590815602]
  Graph Neural Networks (GNNs) are widely adopted in digital pathology. Existing explainers discover an explanatory subgraph relevant to the prediction. An explanatory subgraph should be not only necessary for prediction, but also sufficient to uncover the most predictive regions. We propose IFEXPLAINER, which generates a necessary and sufficient explanation for GNNs.
  arXiv  Detail & Related papers  (2021-12-18T10:19:01Z)
• SEEN: Sharpening Explanations for Graph Neural Networks using Explanations from Neighborhoods [0.0]
  We propose a method to improve the explanation quality of node classification tasks through aggregation of auxiliary explanations. Applying SEEN does not require modification of a graph and can be used with diverse explainability techniques. Experiments on matching motif-participating nodes from a given graph show great improvement in explanation accuracy of up to 12.71%.
  arXiv  Detail & Related papers  (2021-06-16T03:04:46Z)
• 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)

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.