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
Proceedings Article
Faithful Knowledge Graph Explanations in Commonsense Question Answering
Guy Aglionby,Simone Teufel +1 more
TL;DR: This paper argues that highly faithful graph-based explanations cannot be extracted from existing models of this type, and confirms this theory with a novel proxy measure for faithfulness and proposes two architecture changes to address the problem.
Generative Explanations for Graph Neural Network: Methods and Evaluations
Jialin Chen,Kenza Aida Amara,Junchi Yu,Rex Ying +3 more
TL;DR: This paper proposes a unified optimization objective for generative explanation methods, comprising two sub-objectives: Attribution and Information constraints, and demonstrates their specific manifestations in various generative model architectures and different explanation scenarios.
2
Journal Article
Understanding Knowledge Integration in Language Models with Graph Convolutions
Yifan Hou,Mrinmaya Sachan +1 more
TL;DR: This paper revisits the KI process in knowledge integration methods with an information-theoretic view and shows that KI can be interpreted using a graph convolution operation, and develops a probe model for interpreting knowledge-enhanced LMs and exposing what kind of knowledge is integrated into these models.
2
Semantic Interpretation and Validation of Graph Attention-based Explanations for GNN Models
Efimia Panagiotaki,Daniele De Martini,Lars Kunze +2 more
TL;DR: This work extends existing attention-based graph explainability methods by analysing the divergence in the attention distributions in relation to semantically sorted feature sets and the behaviour of a GNN model, efficiently estimating feature importance.
Which Sentence Representation is More Informative: An Analysis on Text Classification
necva bölücü,Burcu Can +1 more
TL;DR: In this article , the semantic representations of UCCA and AMR are used as semantic information and the dependency tree is used as syntactic information for text classification, which is a semantic-aware model.
2
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.