Search to Fine-Tune Pre-Trained Graph Neural Networks for Graph-Level Tasks
Zhili Wang, Shimin Di, Lei Chen, Xiaofang Zhou
Abstract
Recently, graph neural networks (GNNs) have shown its unprecedented success in many graph-related tasks. However, GNNs face the label scarcity issue as other neural networks do. Thus, recent efforts try to pre-train GNNs on a large-scale unlabeled graph and adapt the knowledge from the unlabeled graph to the target downstream task. The adaptation is generally achieved by fine-tuning the pre-trained GNNs with a limited number of labeled data. However, current GNNs pre-training works focus more on how to better pre-train a GNN, but ignore the importance of fine-tuning to better leverage the transferred knowledge. Only a few works start to investigate a better fine-tuning strategy for pre-trained GNNs. But their designs either have strong assumptions or overlook the data-aware issue behind various downstream domains. To further boost pre-trained GNNs, we propose to search to fine-tune pre-trained GNNs for graph-level tasks (S2PGNN), which can adaptively design a suitable fine-tuning framework for the given pre-trained GNN and downstream data. Unfortunately, it is a non-trivial task to achieve this goal due to two technical challenges. First is the hardness of fine-tuning space design since there lack a systematic and unified exploration in existing literature. Second is the enormous computational overhead required for discovering suitable fine-tuning strategies from the discrete space. To tackle these challenges, S2PGNN first carefully summarizes a search space of fine-tuning strategies that is suitable for GNNs, which is expressive enough to enable powerful strategies to be searched. Then, S2PGNN integrates an efficient search algorithm to solve the computationally expensive search problem from a discrete and large space. The empirical studies show that S2PGNN can be implemented on the top of 10 famous pre-trained GNNs and consistently improve their performance by 9 % to 17 %. Our code is publicly available at https://github.com/zwangeo/icde2024.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 826eb717-5df8-4ec0-9137-40e49595ca15Cited by top-tier papers12
- Edge Prompt Tuning for Graph Neural NetworksXingbo Fu, Yinhan He, Jundong LiICLR 2025 · 140 citations
- GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuningHaonan Yuan, Qingyun Sun, Junhua Shi, Xingcheng Fu et al.NeurIPS 2025 · 17 citations
- Effective Data Selection and Replay for Unsupervised Continual LearningHanmo Liu, Shimin Di, Haoyang Li, Shuangyin Li et al.ICDE 2024 · 7 citations
- GraphTOP: Graph Topology-Oriented Prompting for Graph Neural NetworksXingbo Fu, Zhenyu Lei, Zihan Chen, Binchi Zhang et al.NeurIPS 2025 · 5 citations
- Towards Fair Graph Neural Networks via Graph Counterfactual Without Sensitive AttributesXuemin Wang, Tianlong Gu, Xuguang Bao, Liang ChangICDE 2025 · 3 citations
Builds on39
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik et al.ICLR 2020 · 1,744 citations
- DeepGCNs: Can GCNs Go As Deep As CNNs?Guohao Li, Matthias Müller, Ali K. Thabet, Bernard GhanemICCV 2019 · 1,586 citations
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
Related papers
- Learning to Pre-train Graph Neural NetworksYuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan ShiAAAI 2021 · 158 citations
- GPPT: Graph Pre-training and Prompt Tuning to Generalize Graph Neural NetworksMingchen Sun, Kaixiong Zhou, Xin He, Ying Wang et al.KDD 2022 · 141 citations
- HG-Adapter: Improving Pre-Trained Heterogeneous Graph Neural Networks with Dual AdaptersYujie Mo, Runpeng Yu, Xiaofeng Zhu, Xinchao WangICLR 2025
- 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
- Scalable Multi-Source Pre-training for Graph Neural NetworksMingkai Lin, Wenzhong Li, Xiaobin Hong, Sanglu LuACM MM 2024 · 2 citations
