AdapterGNN: Parameter-Efficient Fine-Tuning Improves Generalization in GNNs
Shengrui Li, Xueting Han, Jing Bai
摘要
Fine-tuning pre-trained models has recently yielded remarkable performance gains in graph neural networks (GNNs). In addition to pre-training techniques, inspired by the latest work in the natural language fields, more recent work has shifted towards applying effective fine-tuning approaches, such as parameter-efficient fine-tuning (PEFT). However, given the substantial differences between GNNs and transformer-based models, applying such approaches directly to GNNs proved to be less effective. In this paper, we present a comprehensive comparison of PEFT techniques for GNNs and propose a novel PEFT method specifically designed for GNNs, called AdapterGNN. AdapterGNN preserves the knowledge of the large pre-trained model and leverages highly expressive adapters for GNNs, which can adapt to downstream tasks effectively with only a few parameters, while also improving the model's generalization ability. Extensive experiments show that AdapterGNN achieves higher performance than other PEFT methods and is the only one consistently surpassing full fine-tuning (outperforming it by 1.6% and 5.7% in the chemistry and biology domains respectively, with only 5% and 4% of its parameters tuned) with lower generalization gaps. Moreover, we empirically show that a larger GNN model can have a worse generalization ability, which differs from the trend observed in large transformer-based models. Building upon this, we provide a theoretical justification for PEFT can improve generalization of GNNs by applying generalization bounds. Our code is available at https://github.com/Lucius-lsr/AdapterGNN .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper9
- PACE: Marrying generalization in PArameter-efficient fine-tuning with Consistency rEgularizationYao Ni, Shan Zhang, Piotr KoniuszNeurIPS 2024 · 被引用 25 次
- GraphKeeper: Graph Domain-Incremental Learning via Knowledge Disentanglement and PreservationZihao Guo, Qingyun Sun, Ziwei Zhang, Haonan Yuan 等NeurIPS 2025 · 被引用 10 次
- GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer LearningZhe-Rui Yang, Jindong Han, Chang-Dong Wang, Hao LiuKDD 2025 · 被引用 5 次
- GeoAda: Efficiently Finetune Geometric Diffusion Models with Equivariant AdaptersWanjia Zhao, Jiaqi Han, Siyi Gu, Mingjian Jiang 等NeurIPS 2025 · 被引用 1 次
- Learning and Editing Universal Graph Prompt Tuning via Reinforcement LearningJinfeng Xu, Zheyu Chen, Shuo Yang, Jinze Li 等KDD 2026 · 被引用 1 次
它引用的顶会 Paper9
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu 等ICLR 2022 · 被引用 18,833 次
- Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context LearningHaokun Liu, Derek Tam, Mohammed Muqeeth, Jay Mohta 等NeurIPS 2022 · 被引用 1,483 次
- AdaptFormer: Adapting Vision Transformers for Scalable Visual RecognitionShoufa Chen, Chongjian Ge, Zhan Tong, Jiangliu Wang 等NeurIPS 2022 · 被引用 1,291 次
- Towards a Unified View of Parameter-Efficient Transfer LearningJunxian He, Chunting Zhou, Xuezhe Ma, Taylor Berg-Kirkpatrick 等ICLR 2022 · 被引用 1,182 次
- Deep Double Descent: Where Bigger Models and More Data HurtPreetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang 等ICLR 2020 · 被引用 1,108 次
相关 Paper
- G-Adapter: Towards Structure-Aware Parameter-Efficient Transfer Learning for Graph Transformer NetworksAnchun Gui, Jinqiang Ye, Han XiaoAAAI 2024 · 被引用 35 次
- Parameter-Efficient Fine-Tuning without Introducing New LatencyBaohao Liao, Yan Meng, Christof MonzACL 2023 · 被引用 26 次
- LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language ModelsZhiqiang Hu, Lei Wang, Yihuai Lan, Wanyu Xu 等EMNLP 2023 · 被引用 200 次
- MEFT: Memory-Efficient Fine-Tuning through Sparse AdapterJitai Hao, Weiwei Sun, Xin Xin, Qi Meng 等ACL 2024 · 被引用 4 次
- Magnitude-Modulated Equivariant Adapter for Parameter-Efficient Fine-Tuning of Equivariant Graph Neural NetworksDian Jin, Yancheng Yuan, Xiaoming TaoAAAI 2026
