arXiv:2605.31427cs.LGcs.DC2026-05

提出高效协作动态图学习框架,解决隐私与计算效率难题。

DG-CoLearn: An Efficient Collaborative Learning Framework for Dynamic Graphs

论文配图:DG-CoLearn: An Efficient Collaborative Learning Framework for Dynamic Graphs
图 1 · 摘自论文原文
  • 增量更新图快照,仅处理时间变化区域。
  • 训练速度提升33.8倍,通信量减少27.4倍。
  • 适合跨客户端隐私保护的动态图建模场景。

动态图学习对建模演化图数据至关重要,但现有方法因频繁全快照重训导致计算开销大,且不适用于数据分片的协作场景。真实图系统中跨分区边不可避免,但直接共享图结构可能违反隐私约束。我们提出DG-CoLearn,一种基于增量图快照处理的客户端无感知协同动态图学习框架,通过时间建模保留历史信息,仅聚焦时间更新影响的图区域进行计算。该增量设计贯穿整个图处理流程,包括服务器中介的嵌入交换机制,实现无需暴露原始跨客户端结构信息的多跳消息传递。大量实验表明,DG-CoLearn在训练时间上最高提升33.8倍,通信开销降低27.4倍,节点分类(F1提升达13.36%)和链接预测(MAP提升达8.27%)任务性能持续优化。结果验证了该框架在效率、可扩展性与客户端间结构隐私保护方面的有效性。

原文摘要 · Abstract (English)

Dynamic graph learning (DGL) is essential for modelling evolving graph data, but existing methods suffer from significant computational overhead due to repeated full-snapshot retraining and are not well-suited for collaborative settings with partitioned data. In realistic graph systems, cross-partition edges are unavoidable, but direct sharing of graph structure between clients may violate privacy constraints. We propose DG-CoLearn, a client-oblivious collaborative dynamic graph learning framework built on incremental graph snapshot processing, which focuses computation on graph regions affected by temporal updates while preserving historical information through temporal modelling. This incremental design is consistently applied across the entire graph processing pipeline, including a server-mediated embedding exchange mechanism to enable accurate multi-hop message passing without exposing raw cross-client structural information. Extensive experiments demonstrate that DG-CoLearn achieves up to 33.8$\times$ speedup in training time and 27.4$\times$ reduction in communication overhead, while consistently improving predictive performance on both node classification (up to 13.36% F1 improvement) and link prediction (up to 8.27% MAP improvement) tasks. These results highlight the effectiveness of DG-CoLearn in bridging efficiency, scalability, and client-to-client structural privacy in collaborative dynamic graph learning.

动态图协同学习隐私保护图神经网络

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