用扩散模型生成未来链接,同时捕捉不确定性与时间序列结构。
Sequence Diffusion Model for Temporal Link Prediction in Continuous-Time Dynamic Graph
- 通过噪声注入和去噪重建历史交互序列,学习完整分布。
- 在多个数据集上优于现有方法,最高提升6.2%(AUC)。
- 适合需要预测不确定性的动态图场景,如社交或金融网络。
动态图中的时序链接预测是许多现实系统的核心问题。现有时序图神经网络主要聚焦于历史交互表示学习,虽性能优异,但均为纯判别模型,仅输出未来链接的点估计,缺乏对未来的不确定性及序列结构的显式建模。本文提出SDG,一种新颖的序列级扩散框架,将动态图学习与生成去噪统一起来。具体而言,SDG对整个历史交互序列注入噪声,并通过条件去噪过程联合重建所有交互嵌入,从而捕捉更全面的交互分布。为使生成过程契合时序链接预测任务,采用交叉注意力去噪解码器引导目标序列重建,并实现端到端优化。在多个时序图基准上的大量实验表明,SDG在时序链接预测任务中持续达到领先性能。
原文摘要 · Abstract (English)
Temporal link prediction in dynamic graphs is a fundamental problem in many real-world systems. Existing temporal graph neural networks mainly focus on learning representations of historical interactions. Despite their strong performance, these models are still purely discriminative, producing point estimates for future links and lacking an explicit mechanism to capture the uncertainty and sequential structure of future temporal interactions. In this paper, we propose SDG, a novel sequence-level diffusion framework that unifies dynamic graph learning with generative denoising. Specifically, SDG injects noise into the entire historical interaction sequence and jointly reconstructs all interaction embeddings through a conditional denoising process, thereby enabling the model to capture more comprehensive interaction distributions. To align the generative process with temporal link prediction, we employ a cross-attention denoising decoder to guide the reconstruction of the destination sequence and optimize the model in an end-to-end manner. Extensive experiments on various temporal graph benchmarks show that SDG consistently achieves state-of-the-art performance in the temporal link prediction task.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。