WWW 2023

GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learning

Yun Zhu, Yaoke Wang, Haizhou Shi, Zhenshuo Zhang, Dian Jiao, Siliang Tang

Main figure for GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learning

Abstract

Graph self-supervised algorithms have achieved significant success in acquiring generic knowledge from abundant unlabeled graph data. These pre-trained models can be applied to various downstream Web applications, saving training time and improving downstream performance. However, variations in attribute semantics across graphs pose challenges in transferring pre-trained models to downstream tasks. Concretely speaking, for example, the additional task-specific node information in downstream tasks (specificity) is usually deliberately omitted so that the pre-trained representation (transferability) can be leveraged. The trade-off as such is termed as ``transferability-specificity dilemma'' in this work. To address this challenge, we introduce an innovative deployment module coined as GraphControl, motivated by ControlNet, to realize better graph domain transfer learning. Specifically, by leveraging universal structural pre-trained models and GraphControl, we align the input space across various graphs and incorporate unique characteristics of target data as conditional inputs. These conditions will be progressively integrated into the model during fine-tuning or prompt tuning through ControlNet, facilitating personalized deployment. Extensive experiments show that our method significantly enhances the adaptability of pre-trained models on target attributed datasets, achieving 1.4-3x performance gain. Furthermore, it outperforms training-from-scratch methods on target data with a comparable margin and exhibits faster convergence. Our codes are available at: https://github.com/wykk00/GraphControl

Benchmark Results

Tested on 1 dataset 3 baseline values reported too low

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

Heterogeneous Graph Benchmarks

#ModelMicro-F1 ↑Paper
1
LMSPS
0.9566 ±0.0020
2
PSHGCN
0.9561 ±0.0012
3
RpHGNN
0.9555 ±0.0029
21
GCN
0.9460 ±0.0031
52
Node2Vec
actual #52 vs paper #146 94 places worse
0.9282
best reported
actual #52 vs paper #146 94 places worse
paper 0.7752 ±0.0038
paper 0.7752 ±0.0038 Δ at pub 0.1530
74
GRACE
actual #74 vs paper #182 108 places worse
0.9128 ±0.0007
best reported
actual #74 vs paper #182 108 places worse
paper 0.5843 ±0.0037
paper 0.5843 ±0.0037 Δ at pub 0.3285
88
GIN
actual #88 vs paper #155 67 places worse
0.8720
best reported
actual #88 vs paper #155 67 places worse
paper 0.7462 ±0.0300
paper 0.7462 ±0.0300 Δ at pub 0.1258
129
COSTA+GraphControl
0.8074 ±0.0065
This paper
133
GRACE+GraphControl
0.8042 ±0.0065
This paper
135
simGRACE+GraphControl
0.8033 ±0.0069
This paper
137
GCC+GraphControl
0.8025 ±0.0090
This paper
138
RoSA+GraphControl
0.8023 ±0.0079
This paper
176
MLP
actual #176 vs paper #176
0.6447 ±0.0136
actual #176 vs paper #176
paper 0.6447 ±0.0136

Improvement within reported uncertainty; not highlighted.

paper 0.6447 ±0.0136 Δ at pub 0.0140
182
COSTA
0.5901 ±0.0019
This paper
183
SimGRACE
0.5787 ±0.0032
This paper
184
GCC
0.5702 ±0.0068
This paper
185
RoSA
0.5641 ±0.0070
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green)