GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning
Zhe-Rui Yang, Jindong Han, Chang-Dong Wang, Hao Liu
摘要
Graph Neural Networks (GNNs) have demonstrated remarkable proficiency in handling a range of graph analytical tasks across various domains, such as e-commerce and social networks. Despite their versatility, GNNs face significant challenges in transferability, limiting their utility in real-world applications. Existing research in GNN transfer learning overlooks discrepancies in distribution among various graph datasets, facing challenges when transferring across different distributions. How to effectively adopt a well-trained GNN to new graphs with varying feature and structural distributions remains an under-explored problem. Taking inspiration from the success of Low-Rank Adaptation (LoRA) in adapting large language models to various domains, we propose GraphLoRA, an effective and parameter-efficient method for transferring well-trained GNNs to diverse graph domains. Specifically, we first propose a Structure-aware Maximum Mean Discrepancy (SMMD) to align divergent node feature distributions across source and target graphs. Moreover, we introduce low-rank adaptation by injecting a small trainable GNN alongside the pre-trained one, effectively bridging structural distribution gaps while mitigating the catastrophic forgetting. Additionally, a structure-aware regularization objective is proposed to enhance the adaptability of the pre-trained GNN to target graph with scarce supervision labels. Extensive experiments on eight real-world datasets demonstrate the effectiveness of GraphLoRA against fourteen baselines by tuning only 20% of parameters, even across disparate graph domains. The code is available at https://github.com/AllminerLab/GraphLoRA .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- One Prompt Fits All: Universal Graph Adaptation for Pretrained ModelsYongqi Huang, Jitao Zhao, Dongxiao He, Xiaobao Wang 等NeurIPS 2025 · 被引用 15 次
- GraphKeeper: Graph Domain-Incremental Learning via Knowledge Disentanglement and PreservationZihao Guo, Qingyun Sun, Ziwei Zhang, Haonan Yuan 等NeurIPS 2025 · 被引用 10 次
- RAG4GFM: Bridging Knowledge Gaps in Graph Foundation Models through Graph Retrieval Augmented GenerationXingliang Wang, Zemin Liu, Junxiao Han, Shuiguang DengNeurIPS 2025 · 被引用 6 次
- Multi-Domain Riemannian Graph Gluing for Building Graph Foundation ModelsLi Sun, Zhenhao Huang, Silei Chen, Lanxu Yang 等ICLR 2026 · 被引用 5 次
- GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural NetworksDongxiao He, Wenxuan Sun, Yongqi Huang, Jitao Zhao 等ICML 2026
它引用的顶会 Paper30
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 被引用 24,064 次
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu 等ICLR 2022 · 被引用 18,833 次
- Adding Conditional Control to Text-to-Image Diffusion ModelsLvmin Zhang, Anyi Rao, Maneesh AgrawalaICCV 2023 · 被引用 6,759 次
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding 等ICML 2020 · 被引用 1,910 次
相关 Paper
- Can Modifying Data Address Graph Domain Adaptation?Renhong Huang, Jiarong Xu, Xin Jiang, Ruichuan An 等KDD 2024 · 被引用 1 次
- Enhancing LLMs for Graph Tasks via Graph-aware LoRA GenerationJunshu Sun, Wanxing Chang, Qingming Huang, Shuhui WangICML 2026
- Collaborative Knowledge Extraction and Integration for Graph Domain Incremental LearningJialu Li, Yu Wang, Wanyu Lin, Pengfei ZhuKDD 2026
- MLDGG: Meta-Learning for Domain Generalization on GraphsQin Tian, Chen Zhao, Minglai Shao, Wenjun Wang 等KDD 2025 · 被引用 3 次
- Learning Adaptive Distribution Alignment with Neural Characteristic Function for Graph Domain AdaptationWei Chen, Xingyu Guo, Shuang Li, Zhao Zhang 等ICLR 2026 · 被引用 3 次
