Open AccessPosted Content
Interpreting Graph Neural Networks for NLP With Differentiable Edge Masking
TL;DR: This work introduces a post-hoc method for interpreting the predictions of GNNs which identifies unnecessary edges and uses this technique as an attribution method to analyze GNN models for two tasks -- question answering and semantic role labeling -- providing insights into the information flow in these models.
read more
Abstract: Graph neural networks (GNNs) have become a popular approach to integrating structural inductive biases into NLP models. However, there has been little work on interpreting them, and specifically on understanding which parts of the graphs (e.g. syntactic trees or co-reference structures) contribute to a prediction. In this work, we introduce a post-hoc method for interpreting the predictions of GNNs which identifies unnecessary edges. Given a trained GNN model, we learn a simple classifier that, for every edge in every layer, predicts if that edge can be dropped. We demonstrate that such a classifier can be trained in a fully differentiable fashion, employing stochastic gates and encouraging sparsity through the expected $L_0$ norm. We use our technique as an attribution method to analyze GNN models for two tasks -- question answering and semantic role labeling -- providing insights into the information flow in these models. We show that we can drop a large proportion of edges without deteriorating the performance of the model, while we can analyse the remaining edges for interpreting model predictions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Which is Making the Contribution: Modulating Unimodal and Cross-modal Dynamics for Multimodal Sentiment Analysis
Ying Zeng,Sijie Mai,Haifeng Hu +2 more
TL;DR: In this article, a modality filter module is proposed to identify and filter out modality noise for the learning of correct cross-modal embedding, which achieves state-of-the-art performance.
Empowering Counterfactual Reasoning over Graph Neural Networks through Inductivity
TL;DR: In this article , the authors proposed an inductive algorithm called INDUCE to predict counterfactual perturbations without requiring instance-specific training and showed that incorporating edge additions leads to better results compared to the existing methods.
xEM: Explainable Entity Matching in Customer 360
Sukriti Jaitly,Deepa Mariam George,Balaji Ganesan,Muhammad Ameen,Srinivas Pusapati +4 more
- 01 Dec 2022
TL;DR: In this paper , explainable entity matching (xEM) is presented, which is a probabilistic matching engine and artificial neural network model for explaining entity matching in Customer 360.
Generating Real-Time Explanations for GNNs via Multiple Specialty Learners and Online Knowledge Distillation
TL;DR: SCALE as mentioned in this paper trains multiple specialty learners to explain GNNs, as creating a single powerful explainer for examining the attributions of interactions in input graphs is complicated, and the explanation phase is generated by multiple explainers corresponding to trained learners.
Proceedings Article
Cross-Space Active Learning on Graph Convolutional Networks
Yufei Tao,Hao Wu,Shiyuan Deng +2 more
TL;DR: This paper formalizes cross-space active learning on a graph convolutional network (GCN) and establishes a new separation in label complexity between the two algorithm types.
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Proceedings Article
Auto-Encoding Variational Bayes
Diederik P. Kingma,Max Welling +1 more
- 01 Jan 2014
TL;DR: A stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case is introduced.
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
"Why Should I Trust You?": Explaining the Predictions of Any Classifier
Marco Tulio Ribeiro,Sameer Singh,Carlos Guestrin +2 more
- 13 Aug 2016
TL;DR: In this article, the authors propose LIME, a method to explain models by presenting representative individual predictions and their explanations in a non-redundant way, framing the task as a submodular optimization problem.
Graph Attention Networks
Petar Veličković,Guillem Cucurull,Arantxa Casanova,Adriana Romero,Pietro Liò,Yoshua Bengio +5 more
- 15 Feb 2018
TL;DR: Graph Attention Networks (GATs) as mentioned in this paper leverage masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.