arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.11629cs.LG
收藏

GP2F: 基于预训练图神经网络自适应融合的跨域图提示学习

GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks

School of Computer Science and Technology, Tianjin University, Tianjin, China(天津大学计算机科学与技术学院,天津,中国)

Dongxiao He, Wenxuan Sun, Yongqi Huang, Jitao Zhao, Di Jin

AI总结:

针对跨域图提示学习中预训练知识与任务特定适应性的互补机制,提出双分支自适应融合方法GP2F,通过对比损失和拓扑一致性损失实现拓扑约束下的自适应融合,在跨域少样本节点和图分类任务上优于现有方法。

摘要:

图提示学习(GPL)最近成为一种有前景的范式,用于预训练图模型的下游适应,缓解预训练目标与下游任务之间的不匹配。最近,GPL的关注点从域内转向跨域场景,这更接近现实世界应用,其中预训练源和下游目标在数据分布上往往存在显著差异。然而,GPL在域偏移下为何仍然有效尚未被探索。经验上,我们观察到代表性的GPL方法在跨域设置中与两个简单基线(全微调和线性探测)具有竞争力,这促使我们更深入地理解提示机制。我们提供理论分析表明,联合利用这两个互补分支比单独使用任一分支产生更小的估计误差,正式证明了跨域GPL受益于预训练知识与任务特定适应性之间的整合。基于这一见解,我们提出GP2F,一种双分支GPL方法,显式实例化两个极端:(1)保留预训练知识的冻结分支,和(2)带有轻量级适配器用于任务特定适应的适配分支。然后,我们通过对比损失和拓扑一致性损失在拓扑约束下执行自适应融合。在跨域少样本节点和图分类上的大量实验表明,我们的方法优于现有方法。

英文摘要:

Graph Prompt Learning (GPL) has recently emerged as a promising paradigm for downstream adaptation of pre-trained graph models, mitigating the misalignment between pre-training objectives and downstream tasks. Recently, the focus of GPL has shifted from in-domain to cross-domain scenarios, which is closer to the real world applications, where the pre-training source and downstream target often differ substantially in data distribution. However, why GPLs remain effective under such domain shifts is still unexplored. Empirically, we observe that representative GPL methods are competitive with two simple baselines in cross-domain settings: full fine-tuning (FT) and linear probing (LP), motivating us to explore a deeper understanding of the prompting mechanism. We provide a theoretical analysis demonstrating that jointly leveraging these two complementary branches yields a smaller estimation error than using either branch alone, formally proving that cross-domain GPL benefits from the integration between pre-trained knowledge and task-specific adaptation. Based on this insight, we propose GP2F, a dual-branch GPL method that explicitly instantiates the two extremes: (1) a frozen branch that retains pre-trained knowledge, and (2) an adapted branch with lightweight adapters for task-specific adaptation. We then perform adaptive fusion under topology constraints via a contrastive loss and a topology-consistent loss. Extensive experiments on cross-domain few-shot node and graph classification demonstrate that our method outperforms existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑