Search to Fine-tune Pre-trained Graph Neural Networks for Graph-level Tasks
Zhili Wang, Shimin Di, Lei Chen, Xiaofang Zhou

TL;DR
This paper introduces S2PGNN, a search-based method to optimize fine-tuning strategies for pre-trained graph neural networks, significantly enhancing their performance on graph-level tasks.
Contribution
It proposes a novel search framework for fine-tuning pre-trained GNNs, addressing data-aware issues and outperforming existing strategies.
Findings
S2PGNN improves performance across 10 pre-trained GNNs.
It outperforms existing fine-tuning strategies.
The method is applicable to various graph-level tasks.
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. Despite the importance of fine-tuning, current GNNs pre-training works often ignore designing a good fine-tuning strategy to better leverage transferred knowledge and improve the performance on downstream tasks. Only 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 for various downstream datasets. Therefore, we aim to design a better…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Machine Learning in Materials Science · Advanced Neural Network Applications
