Mutual information estimation for graph convolutional neural networks
Measuring model performance is a key issue for deep learning practitioners. However, we often lack the ability to explain why a specific architecture attains superior predictive accuracy for a given data set. Often, validation accuracy is used as a performance heuristic quantifying how well a network generalizes to unseen data, but it does not capture anything about the information flow in the model. Mutual information can be used as a measure of the quality of internal representations in deep learning models, and the information plane may provide insights into whether the model exploits the available information in the data. The information plane has previously been explored for fully connected neural networks and convolutional architectures. We present an architecture-agnostic method for tracking a network's internal representations during training, which are then used to create the mutual information plane. The method is exemplified for graph-based neural networks fitted on citation data. We compare how the inductive bias introduced in graph-based architectures changes the mutual information plane relative to a fully connected neural network.
Code (0)
등록된 구현이 없습니다.
Tasks
Inductive BiasInformation PlaneMutual Information EstimationSimilar Papers 제목 키워드 기반
CNN-Aided Factor Graphs with Estimated Mutual Information Features for Seizure Detection
We propose a convolutional neural network (CNN) aided factor graphs assisted by mutual information features estimated by a neural network for seizure detection. Specifically, we use neural mutual information estimation t…
EEGElectroencephalogram (EEG)Mutual Information EstimationSeizure DetectionRecognizing Predictive Substructures with Subgraph Information Bottleneck
The emergence of Graph Convolutional Network (GCN) has greatly boosted the progress of graph learning. However, two disturbing factors, noise and redundancy in graph data, and lack of interpretation for prediction result…
Bilevel OptimizationGraph LearningExponential Concentration for Mutual Information Estimation with Application to Forests
We prove a new exponential concentration inequality for a plug-in estimator of the Shannon mutual information. Previous results on mutual information estimation only bounded expected error. The advantage of having the ex…
Mutual Information EstimationTopoTER: Unsupervised Learning of Topology Transformation Equivariant Representations
We present the Topology Transformation Equivariant Representation (TopoTER) learning, a general paradigm of unsupervised learning of node representations of graph data for the wide applicability to Graph Convolutional Ne…
Graph ClassificationSelf-Supervised Graph Representation Learning via Topology Transformations
We present the Topology Transformation Equivariant Representation learning, a general paradigm of self-supervised learning for node representations of graph data to enable the wide applicability of Graph Convolutional Ne…
Graph ClassificationGraph Representation LearningLink PredictionNode Classification+2