mlsanityData to 14 Oct 2026

SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embedding

arXiv 2308.14129 ↗First posted 27 Aug 2023cs.LG cs.DC cs.SIcited by 7

Not on the map. Why?

Abstract (arXiv)

Temporal Interaction Graphs (TIGs) are widely employed to model intricate real-world systems such as financial systems and social networks. To capture the dynamism and interdependencies of nodes, existing TIG embedding models need to process edges sequentially and chronologically. However, this requirement prevents it from being processed in parallel and struggle to accommodate burgeoning data volumes to GPU. Consequently, many large-scale temporal interaction graphs are confined to CPU processing. Furthermore, a generalized GPU scaling and acceleration approach remains unavailable. To facilitate large-scale TIGs' implementation on GPUs for acceleration, we introduce a novel training approach namely Streaming Edge Partitioning and Parallel Acceleration for Temporal Interaction Graph Embedding (SPEED). The SPEED is comprised of a Streaming Edge Partitioning Component (SEP) which addresses space overhead issue by assigning fewer nodes to each GPU, and a Parallel Acceleration Component (PAC) which enables simultaneous training of different sub-graphs, addressing time overhead issue. Our method can achieve a good balance in computing resources, computing time, and downstream task performance. Empirical validation across 7 real-world datasets demonstrates the potential to expedite training speeds by a factor of up to 19.29x. Simultaneously, resource consumption of a single-GPU can be diminished by up to 69%, thus enabling the multiple GPU-based training and acceleration encompassing millions of nodes and billions of edges. Furthermore, our approach also maintains its competitiveness in downstream tasks.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 17 of its 37 references that are in the map. First posted on arXiv 27 Aug 2023.

Builds on

17 of 37 references.

References · 17

  1. 2017Inductive Representation Learning on Large Graphscited by 6,320
  2. 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
  3. 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
  4. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  5. 2020Inductive Representation Learning on Temporal Graphscited by 462
  6. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
  7. 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 193
  8. 2019AliGraph: A Comprehensive Graph Neural Network Platformcited by 153
  9. 2020DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphscited by 139
  10. 2022DGraph: A Large-Scale Financial Dataset for Graph Anomaly Detectioncited by 63
  11. 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 61
  12. 2021DistGNN: Scalable Distributed Training for Large-Scale Graph Neural Networkscited by 59
5 more
  1. 2022Provably expressive temporal graph networkscited by 56
  2. 2021BGL: GPU-Efficient GNN Training by Optimizing Graph Data I/O and Preprocessingcited by 50
  3. 2020Learning Optimal Tree Models Under Beam Searchcited by 26
  4. 2023TIGER: Temporal Interaction Graph Embedding with Restartscited by 17
  5. 2021Efficient Dynamic Graph Representation Learning at Scalecited by 8

Built on by

Cited by year

Citing papers per year: 2024: 5; 2025: 2.

7 papers.