NeurIPS 2023

Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networks

Jiarong Xu, Renhong Huang, Xin Jiang, Yuxuan Cao, Carl Yang, Chunping Wang, Yang Yang

Main figure for Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networks

Abstract

Pre-training on graph neural networks (GNNs) aims to learn transferable knowledge for downstream tasks with unlabeled data, and it has recently become an active research area. The success of graph pre-training models is often attributed to the massive amount of input data. In this paper, however, we identify the curse of big data phenomenon in graph pre-training: more training data do not necessarily lead to better downstream performance. Motivated by this observation, we propose a better-with-less framework for graph pre-training: fewer, but carefully chosen data are fed into a GNN model to enhance pre-training. The proposed pre-training pipeline is called the data-active graph pre-training (APT) framework, and is composed of a graph selector and a pre-training model. The graph selector chooses the most representative and instructive data points based on the inherent properties of graphs as well as predictive uncertainty. The proposed predictive uncertainty, as feedback from the pre-training model, measures the confidence level of the model in the data. When fed with the chosen data, on the other hand, the pre-training model grasps an initial understanding of the new, unseen data, and at the same time attempts to remember the knowledge learned from previous data. Therefore, the integration and interaction between these two components form a unified framework (APT), in which graph pre-training is performed in a progressive and iterative way. Experiment results show that the proposed APT is able to obtain an efficient pre-training model with fewer training data and better downstream performance.

Proposed method: APT (Mole-BERT)

Benchmark Results

Tested on 8 datasets Non-standard metric on 2 datasets

Tables show presented results in global context (best 3 papers + GCN + MLP).

TU Dortmund

COLLAB

Global leaderboard →
Non-default metric. This paper reports F1; the dataset default is Accuracy. Values below use F1 only.
#ModelF1 ↑Paper
1
APT (Mole-BERT)
0.8123 ±0.0086
This paper

IMDB-BINARY

Global leaderboard →
Non-default metric. This paper reports F1; the dataset default is Accuracy. Values below use F1 only.

Sorted by F1. Highlighted rows are from other papers.

#ModelF1 ↑Paper
1
APT-P (fine-tune)
0.7670 ±0.0101
This paper
2
APT-R (fine-tune)
0.7660 ±0.0102
This paper
3
APT-G (fine-tune)
0.7629 ±0.0089
This paper
4
APT (Mole-BERT)
0.7627 ±0.0120
This paper
5
GCC (fine-tune)
0.7619 ±0.0090
This paper
6
APT-L2 (fine-tune)
0.7593 ±0.0084
This paper
7
GIN
0.7200 ±0.0241
This paper
8
DGCNN
0.7100 ±0.0469
This paper
9
JOAO (fine-tune)
0.6850 ±0.0361
This paper
10
GraphCL (fine-tune)
0.6690 ±0.0439
This paper
11
InfoGraph
0.6658 ±0.0063
This paper
12
graph2vec
0.5620 ±0.0533
This paper
13
Random
0.4930 ±0.0482
This paper

MoleculeNet

#ModelROC-AUC ↑Paper
1
HIMP
0.8740 ±0.0050
2
GINE w/ VN
0.8720 ±0.0030
3
NaiveGINe+ K=3 w/ VN
0.8700 ±0.0040
14
GCN
0.8400 ±0.0040
154
APT (Mole-BERT)
0.7700 ±0.0040
This paper
#ModelROC-AUC ↑Paper
1
GeomGCL
0.7630
2
LiGhT DeepGPT
0.7570 ±0.0110
3
CoMPT
0.7550
14
GCN
0.7350 ±0.0020
108
APT (Mole-BERT)
0.6500 ±0.0030
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers)