GPPT: Graph Pre-training and Prompt Tuning to Generalize Graph Neural Networks
Mingchen Sun, Kaixiong Zhou, Xin He, Ying Wang, Xin Wang
Abstract
Despite the promising representation learning of graph neural networks (GNNs), the supervised training of GNNs notoriously requires large amounts of labeled data from each application. An effective solution is to apply the transfer learning in graph: using easily accessible information to pre-train GNNs, and fine-tuning them to optimize the downstream task with only a few labels. Recently, many efforts have been paid to design the self-supervised pretext tasks, and encode the universal graph knowledge among the various applications. However, they rarely notice the inherent training objective gap between the pretext and downstream tasks. This significant gap often requires costly fine-tuning for adapting the pre-trained model to downstream problem, which prevents the efficient elicitation of pre-trained knowledge and then results in poor results. Even worse, the naive pre-training strategy usually deteriorates the downstream task, and damages the reliability of transfer learning in graph data. To bridge the task gap, we propose a novel transfer learning paradigm to generalize GNNs, namely graph pre-training and prompt tuning (GPPT). Specifically, we first adopt the masked edge prediction, the most simplest and popular pretext task, to pre-train GNNs. Based on the pre-trained model, we propose the graph prompting function to modify the standalone node into a token pair, and reformulate the downstream node classification looking the same as edge prediction. The token pair is consisted of candidate label class and node entity. Therefore, the pre-trained GNNs could be applied without tedious fine-tuning to evaluate the linking probability of token pair, and produce the node classification decision. The extensive experiments on eight benchmark datasets demonstrate the superiority of GPPT, delivering an average improvement of 4.29% in few-shot graph analysis and accelerating the model convergence up to 4.32X. The code is available in: https://github.com/MingChen-Sun/GPPT.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers99
- GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural NetworksZemin Liu, Xingtong Yu, Yuan Fang, Xinming ZhangWWW 2023 · 263 citations
- GraphGPT: Graph Instruction Tuning for Large Language ModelsJiabin Tang, Yuhao Yang, Wei Wei, Lei Shi et al.SIGIR 2024 · 182 citations
- Universal Prompt Tuning for Graph Neural NetworksTaoran Fang, Yunchao Zhang, Yang Yang, Chunping Wang et al.NeurIPS 2023 · 166 citations
- All in One: Multi-Task Prompting for Graph Neural NetworksXiangguo Sun, Hong Cheng, Jia Li, Bo Liu et al.KDD 2023 · 149 citations
- Edge Prompt Tuning for Graph Neural NetworksXingbo Fu, Yinhan He, Jundong LiICLR 2025 · 140 citations
Related papers
- HGPrompt: Bridging Homogeneous and Heterogeneous Graphs for Few-Shot Prompt LearningXingtong Yu, Yuan Fang, Zemin Liu, Xinming ZhangAAAI 2024 · 68 citations
- MultiGPrompt for Multi-Task Pre-Training and Prompting on GraphsXingtong Yu, Chang Zhou, Yuan Fang, Xinming ZhangWWW 2024 · 65 citations
- Adaptive Transfer Learning on Graph Neural NetworksXueting Han, Zhenhuan Huang, Bang An, Jing BaiKDD 2021 · 30 citations
- Inductive Graph Alignment Prompt: Bridging the Gap between Graph Pre-training and Inductive Fine-tuning From Spectral PerspectiveYuchen Yan, Peiyan Zhang, Zheng Fang, Qingqing LongWWW 2024 · 22 citations
- HePa: Heterogeneous Graph Prompting for All-Level Classification TasksJia Jinghong, Lei Song, Jiaxing Li, Youyong KongAAAI 2025 · 2 citations
