提出新型脉冲嵌入架构,高效学习大规模动态图表示。
Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs

- 按时间分节点为上下文与目标集,利用时空信息互预测
- 1300万边动态图上表现超越基线,训练效率更高
- 无需复杂构造,适合资源受限的下游任务
动态图学习旨在捕捉现实系统中随时间演化的结构与语义模式,如欺诈检测和推荐系统。由于真实动态图中标签数据稀缺,近期研究引入生成或对比范式(如掩码图自编码器或图对比学习)生成任务无关的图嵌入。然而,这些方法通常依赖复杂的边级重构目标和定制化图增强策略,导致在大规模动态图上扩展时计算开销巨大。本文提出SG-JEPA,一种面向大规模动态图的联合脉冲嵌入预测架构。与现有自监督方法不同,SG-JEPA沿时间维度将节点划分为上下文与目标集,通过额外的时空信息实现彼此嵌入的预测。此外,通过将序列输入编码为粗到细的脉冲计数嵌入,脉冲神经元使SG-JEPA能够适应下游任务的不同计算约束。大量实验表明,SG-JEPA在节点分类任务上达到与判别基线相当甚至更优的性能,同时有效扩展至含1300万条边的动态图。相比以往自监督动态图基线,SG-JEPA避免了负采样、图增强、边级重构等复杂机制,实现了更优的训练效率与内存可扩展性。
原文摘要 · Abstract (English)
Dynamic graph learning aims to capture evolving structural and semantic patterns in real-world systems, such as fraud detection and recommender systems. Due to the scarcity of labeled data in real-world dynamic graphs, recent studies have introduced generative or contrastive paradigms (e.g., masked graph autoencoders or graph contrastive learning) to generate task-agnostic graph embeddings. However, these methods typically rely on complex edge-level reconstruction objectives and tailored graph augmentation strategies. This incurs substantial computational overhead when scaling to large-scale dynamic graphs. In this paper, we propose SG-JEPA, a joint spiking embedding predictive architecture for large-scale dynamic graphs. In contrast to existing self-supervised methods, SG-JEPA partitions nodes into context and target sets along the temporal dimension to learn embeddings that are predictive of each other via additional spatial-temporal information. Furthermore, through encoding sequential inputs into coarse-to-fine spike count embeddings, spiking neurons enable SG-JEPA to adapt to the varying computational constraints of downstream tasks. Extensive experiments demonstrate that SG-JEPA achieves competitive or even superior performance over discriminative baselines on node classification, while effectively scaling to the dynamic graph with 13 million edges. SG-JEPA avoids the complex machinery (negative sampling, graph augmentations, edge-level reconstruction, etc.), resulting in superior training efficiency and memory scalability compared with prior self-supervised dynamic graph baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。