arXiv:2601.11954cs.LG2026-01被引 4

通过数据级提示调整,让预训练图模型更好适应少样本下游任务。

Data-centric Prompt Tuning for Dynamic Graphs

  • 在输入层用三个提示矩阵动态调整节点特征,融合时空信息。
  • 在四个公开数据集上少样本测试中显著超越传统方法和现有提示法。
  • 无需修改模型架构,适配性强,特别适合冷启动场景使用。

动态图因其能刻画现实世界中复杂且演化的关系而受到关注。传统方法通常通过动态链接预测预训练模型,并直接将得到的节点时序嵌入用于下游任务,但不同任务间的差异常导致性能下降,尤其在少样本设置下。提示调优(Prompt Tuning)为此提供了一种有效解决方案。然而,现有提示方法往往与特定模型架构或预训练任务强耦合,难以适配新模型;同时仅关注节点或时序特征,忽略空间结构信息,表达能力受限。为此,我们提出DDGPrompt——一种数据级提示框架,旨在从输入数据层面精炼预训练节点嵌入,增强对多样化下游任务的适应性。首先定义统一的节点表征特征矩阵,整合每个节点的全部时序与结构信息,兼容多种动态图模型。随后引入三种提示矩阵(时序偏置、边权重、特征掩码),完全调控该特征矩阵,实现节点嵌入的任务特异性调整。我们在四个公开动态图数据集上,在严格少样本设置下评估了DDGPrompt。实验结果表明,该方法在标签稀缺和冷启动条件下显著优于传统方法及现有提示方法。

原文摘要 · Abstract (English)

Dynamic graphs have attracted increasing attention due to their ability to model complex and evolving relationships in real-world scenarios. Traditional approaches typically pre-train models using dynamic link prediction and directly apply the resulting node temporal embeddings to specific downstream tasks. However, the significant differences among downstream tasks often lead to performance degradation, especially under few-shot settings. Prompt tuning has emerged as an effective solution to this problem. Existing prompting methods are often strongly coupled with specific model architectures or pretraining tasks, which makes it difficult to adapt to recent or future model designs. Moreover, their exclusive focus on modifying node or temporal features while neglecting spatial structural information leads to limited expressiveness and degraded performance. To address these limitations, we propose DDGPrompt, a data-centric prompting framework designed to effectively refine pre-trained node embeddings at the input data level, enabling better adaptability to diverse downstream tasks. We first define a unified node expression feature matrix that aggregates all relevant temporal and structural information of each node, ensuring compatibility with a wide range of dynamic graph models. Then, we introduce three prompt matrices (temporal bias, edge weight, and feature mask) to adjust the feature matrix completely, achieving task-specific adaptation of node embeddings. We evaluate DDGPrompt under a strict few-shot setting on four public dynamic graph datasets. Experimental results demonstrate that our method significantly outperforms traditional methods and prompting approaches in scenarios with limited labels and cold-start conditions.

动态图提示调优少样本学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。