GraphCL: Contrastive Self-Supervised Learning of Graph Representations
arXiv:2007.08025
Abstract
We propose Graph Contrastive Learning (GraphCL), a general framework for learning node representations in a self supervised manner. GraphCL learns node embeddings by maximizing the similarity between the representations of two randomly perturbed versions of the intrinsic features and link structure of the same node's local subgraph. We use graph neural networks to produce two representations of the same node and leverage a contrastive learning loss to maximize agreement between them. In both transductive and inductive learning setups, we demonstrate that our approach significantly outperforms the state-of-the-art in unsupervised learning on a number of node classification benchmarks.
Under review for Neurips 2020
References in corpus (6)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Semi-Supervised Classification with Graph Convolutional Networks
- Fast Graph Representation Learning with PyTorch Geometric
- Variational Graph Auto-Encoders
- Predicting multicellular function through multi-layer tissue networks
- FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling