arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.07239cs.LGcs.AIcs.SI
收藏

ROLAND:动态图的图学习框架

ROLAND: Graph Learning Framework for Dynamic Graphs

Stanford University(斯坦福大学)

Jiaxuan You, Tianyu Du, Jure Leskovec

摘要:

图神经网络(GNNs)已经成功地应用于许多现实世界的静态图。然而,由于模型设计、评估设置和训练策略的限制,静态图的成功还没有完全转化为动态图。具体地说,现有的动态GNN没有结合静态GNN的最新设计,这限制了它们的性能。动态GNN的当前评估设置不能完全反映动态图的演变性质。最后,动态GNN的常用训练方法是不可扩展的。在这里,我们提出了ROLAND,一个有效的图形表示学习框架,为现实世界的动态图形。在其核心,ROLAND框架可以帮助研究人员轻松地将任何静态GNN重新用于动态图形。我们的见解是将不同GNN层的节点嵌入视为分层节点状态,然后随着时间的推移循环更新它们。然后,我们为动态图引入了一个实时更新评估设置,该设置模拟了真实世界的用例,其中GNN正在进行预测并在滚动的基础上进行更新。最后,我们通过增量训练和元学习为动态GNN提出了一种可扩展且高效的训练方法。我们在八个不同的动态图数据集上对未来的链接预测任务进行了实验。在三个数据集的标准评估设置下,使用ROLAND框架构建的模型相对于最先进的基线平均实现了62.7%的相对平均倒数秩(MRR)改进。我们发现,对于较大的数据集,最先进的基线会出现内存不足的错误,而ROLAND可以轻松扩展到具有5600万条边的动态图形。在使用ROLAND培训策略重新实施这些基线后,ROLAND模型仍然比基线平均提高了15.5%的相对MRR。

英文摘要:

Graph Neural Networks (GNNs) have been successfully applied to many real-world static graphs. However, the success of static graphs has not fully translated to dynamic graphs due to the limitations in model design, evaluation settings, and training strategies. Concretely, existing dynamic GNNs do not incorporate state-of-the-art designs from static GNNs, which limits their performance. Current evaluation settings for dynamic GNNs do not fully reflect the evolving nature of dynamic graphs. Finally, commonly used training methods for dynamic GNNs are not scalable. Here we propose ROLAND, an effective graph representation learning framework for real-world dynamic graphs. At its core, the ROLAND framework can help researchers easily repurpose any static GNN to dynamic graphs. Our insight is to view the node embeddings at different GNN layers as hierarchical node states and then recurrently update them over time. We then introduce a live-update evaluation setting for dynamic graphs that mimics real-world use cases, where GNNs are making predictions and being updated on a rolling basis. Finally, we propose a scalable and efficient training approach for dynamic GNNs via incremental training and meta-learning. We conduct experiments over eight different dynamic graph datasets on future link prediction tasks. Models built using the ROLAND framework achieve on average 62.7% relative mean reciprocal rank (MRR) improvement over state-of-the-art baselines under the standard evaluation settings on three datasets. We find state-of-the-art baselines experience out-of-memory errors for larger datasets, while ROLAND can easily scale to dynamic graphs with 56 million edges. After re-implementing these baselines using the ROLAND training strategy, ROLAND models still achieve on average 15.5% relative MRR improvement over the baselines.

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

↑