Mutual Information Maximization in Graph Neural Networks
A variety of graph neural networks (GNNs) frameworks for representation learning on graphs have been recently developed. These frameworks rely on aggregation and iteration scheme to learn the representation of nodes. However, information between nodes is inevitably lost in the scheme during learning. In order to reduce the loss, we extend the GNNs frameworks by exploring the aggregation and iteration scheme in the methodology of mutual information. We propose a new approach of enlarging the normal neighborhood in the aggregation of GNNs, which aims at maximizing mutual information. Based on a series of experiments conducted on several benchmark datasets, we show that the proposed approach improves the state-of-the-art performance for four types of graph tasks, including supervised and semi-supervised graph classification, graph link prediction and graph edge generation and classification.
Code (2)
Tasks
General ClassificationGraph ClassificationGraph Neural NetworkLink PredictionRepresentation LearningSimilar Papers 제목 키워드 기반
MOLE: MOdular Learning FramEwork via Mutual Information Maximization
This paper is to introduce an asynchronous and local learning framework for neural networks, named Modular Learning Framework (MOLE). This framework modularizes neural networks by layers, defines the training objective v…
Deep Graph Clustering via Mutual Information Maximization and Mixture Model
Attributed graph clustering or community detection which learns to cluster the nodes of a graph is a challenging task in graph analysis. In this paper, we introduce a contrastive learning framework for learning clusterin…
ClusteringCommunity DetectionContrastive LearningGraph Clustering+1Maximizing Mutual Information Across Feature and Topology Views for Learning Graph Representations
Recently, maximizing mutual information has emerged as a powerful method for unsupervised graph representation learning. The existing methods are typically effective to capture information from the topology view but igno…
DiversityGraph Representation LearningLinear evaluationRepresentation LearningGraph Pooling via Coarsened Graph Infomax
Graph pooling that summaries the information in a large graph into a compact form is essential in hierarchical graph representation learning. Existing graph pooling methods either suffer from high computational complexit…
Contrastive LearningGraph Representation LearningRepresentation LearningGraph Representation Learning via Graphical Mutual Information Maximization
The richness in the content of various information networks such as social networks and communication networks provides the unprecedented potential for learning high-quality expressive representations without external su…
Graph Representation LearningLink PredictionMutual Information EstimationNode Classification+1