用极小图保持动态图学习性能,训练速度提升超千倍
Dynamic Graph Condensation
- 通过模拟神经元放电机制生成动态连边,还原真实演化结构
- 仅用原图0.5%规模,保留96.2%模型性能,训练提速1846倍
- 适合大规模动态图场景下的高效模型训练与部署
深度图学习研究正从静态图转向动态图,以应对复杂现实系统中的演化行为。然而,动态图的时间扩展带来了数据效率挑战,包括数据量激增、时空冗余高以及对昂贵的动态图神经网络(DGNN)的依赖。为此,我们首次提出动态图压缩(DGC),旨在大幅缩减动态图规模以实现高效的DGNN训练。我们提出DyGC框架,将真实动态图压缩为紧凑版本,同时忠实保留其内在时空特性。具体而言,为使合成图具备真实演化结构,引入一种新型脉冲结构生成机制,借鉴神经元放电动态建模动态图的时间感知连接性。针对紧密耦合的时空依赖,DyGC提出定制化的分布匹配方法:首先构建语义丰富的状态演化场,再进行细粒度时空状态对齐,指导压缩图优化。在多个动态图数据集和代表性DGNN架构上的实验表明,DyGC效果显著:仅用原图0.5%的规模,即可保留高达96.2%的DGNN性能,并实现最高达1846倍的训练加速。
原文摘要 · Abstract (English)
Recent research on deep graph learning has shifted from static to dynamic graphs, motivated by the evolving behaviors observed in complex real-world systems. However, the temporal extension in dynamic graphs poses significant data efficiency challenges, including increased data volume, high spatiotemporal redundancy, and reliance on costly dynamic graph neural networks (DGNNs). To alleviate the concerns, we pioneer the study of dynamic graph condensation (DGC), which aims to substantially reduce the scale of dynamic graphs for data-efficient DGNN training. Accordingly, we propose DyGC, a novel framework that condenses the real dynamic graph into a compact version while faithfully preserving the inherent spatiotemporal characteristics. Specifically, to endow synthetic graphs with realistic evolving structures, a novel spiking structure generation mechanism is introduced. It draws on the dynamic behavior of spiking neurons to model temporally-aware connectivity in dynamic graphs. Given the tightly coupled spatiotemporal dependencies, DyGC proposes a tailored distribution matching approach that first constructs a semantically rich state evolving field for dynamic graphs, and then performs fine-grained spatiotemporal state alignment to guide the optimization of the condensed graph. Experiments across multiple dynamic graph datasets and representative DGNN architectures demonstrate the effectiveness of DyGC. Notably, our method retains up to 96.2% DGNN performance with only 0.5% of the original graph size, and achieves up to 1846 times training speedup.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。