arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.16002cs.LG
收藏

ScaDyG:大规模动态图学习的新范式

ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning

Xiang Wu, Xunkai Li, Rong-Hua Li, Kangfei Zhao, Guoren Wang

AI总结:

针对动态图历史交互增长带来的可扩展性问题,提出ScaDyG,通过时间感知拓扑重构、动态时间编码与超网络驱动的消息聚合实现高效学习,在12个数据集上以更少参数和更高效率达到或超越SOTA方法。

摘要:

动态图(DGs)捕捉图实体间随时间演变的关系,在现实世界中有着广泛的应用。为了高效编码动态图以用于下游任务,大多数动态图神经网络遵循传统的消息传递机制,并用基于时间的技术对其进行扩展。尽管这些方法很有效,但历史交互的增长引入了显著的可扩展性问题,尤其是在工业场景中。为了解决这一局限性,我们提出了ScaDyG,其核心思想是设计一种时间感知的可扩展学习范式,具体如下:1)时间感知拓扑重构:ScaDyG首先基于动态建模将历史交互分割为时间步(步内和步间),从而在预处理中实现免权重和时间感知的图传播。2)动态时间编码:为了在时间步内进一步实现细粒度的图传播,ScaDyG以可扩展的方式通过指数函数的组合集成了时间编码。3)超网络驱动的消息聚合:在获得传播特征(即消息)后,ScaDyG利用超网络分析历史依赖关系,通过自适应时间融合实现节点级表示。在12个数据集上的大量实验表明,ScaDyG在节点和链路级下游任务中表现相当甚至优于其他SOTA方法,且具有更少的可学习参数和更高的效率。

英文摘要:

Dynamic graphs (DGs), which capture time-evolving relationships between graph entities, have widespread real-world applications. To efficiently encode DGs for downstream tasks, most dynamic graph neural networks follow the traditional message-passing mechanism and extend it with time-based techniques. Despite their effectiveness, the growth of historical interactions introduces significant scalability issues, particularly in industry scenarios. To address this limitation, we propose ScaDyG, with the core idea of designing a time-aware scalable learning paradigm as follows: 1) Time-aware Topology Reformulation: ScaDyG first segments historical interactions into time steps (intra and inter) based on dynamic modeling, enabling weight-free and time-aware graph propagation within pre-processing. 2) Dynamic Temporal Encoding: To further achieve fine-grained graph propagation within time steps, ScaDyG integrates temporal encoding through a combination of exponential functions in a scalable manner. 3) Hypernetwork-driven Message Aggregation: After obtaining the propagated features (i.e., messages), ScaDyG utilizes hypernetwork to analyze historical dependencies, implementing node-wise representation by an adaptive temporal fusion. Extensive experiments on 12 datasets demonstrate that ScaDyG performs comparably well or even outperforms other SOTA methods in both node and link-level downstream tasks, with fewer learnable parameters and higher efficiency.

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

↑