Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks

Abstract

Self-supervised learning has gradually emerged as a powerful technique for graph representation learning. However, transferable, generalizable, and robust representation learning on graph data still remains a challenge for pre-training graph neural networks. In this paper, we propose a simple and effective self-supervised pre-training strategy, named Pairwise Half-graph Discrimination (PHD), that explicitly pre-trains a graph neural network at graph-level. PHD is designed as a simple binary classification task to discriminate whether two half-graphs come from the same source. Experiments demonstrate that the PHD is an effective pre-training strategy that offers comparable or superior performance on 13 graph classification tasks compared with state-of-the-art strategies, and achieves notable improvements when combined with node-level strategies. Moreover, the visualization of learned representation revealed that PHD strategy indeed empowers the model to learn graph-level knowledge like the molecular scaffold. These results have established PHD as a powerful and effective self-supervised learning strategy in graph-level representation learning.

arXiv commentaccepted by the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)

References in corpus (10)

• UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
• Inductive Representation Learning on Large Graphs
• graph2vec: Learning Distributed Representations of Graphs
• Towards Deeper Graph Neural Networks
• Contrastive Multi-View Representation Learning on Graphs
• How Powerful are Graph Neural Networks?
• DeeperGCN: All You Need to Train Deeper GCNs
• Strategies for Pre-training Graph Neural Networks
• InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization
• Motif-Driven Contrastive Learning of Graph Representations