Pith. sign in

REVIEW 4 cited by

TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.14883 v2 pith:HLNJYJ4L submitted 2022-03-28 cs.LG

classification cs.LG
keywords temporaldatasetsgraphneuralnodetrainingframeworkinformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many real world graphs contain time domain information. Temporal Graph Neural Networks capture temporal information as well as structural and contextual information in the generated dynamic node embeddings. Researchers have shown that these embeddings achieve state-of-the-art performance in many different tasks. In this work, we propose TGL, a unified framework for large-scale offline Temporal Graph Neural Network training where users can compose various Temporal Graph Neural Networks with simple configuration files. TGL comprises five main components, a temporal sampler, a mailbox, a node memory module, a memory updater, and a message passing engine. We design a Temporal-CSR data structure and a parallel sampler to efficiently sample temporal neighbors to formtraining mini-batches. We propose a novel random chunk scheduling technique that mitigates the problem of obsolete node memory when training with a large batch size. To address the limitations of current TGNNs only being evaluated on small-scale datasets, we introduce two large-scale real-world datasets with 0.2 and 1.3 billion temporal edges. We evaluate the performance of TGL on four small-scale datasets with a single GPU and the two large datasets with multiple GPUs for both link prediction and node classification tasks. We compare TGL with the open-sourced code of five methods and show that TGL achieves similar or better accuracy with an average of 13x speedup. Our temporal parallel sampler achieves an average of 173x speedup on a multi-core CPU compared with the baselines. On a 4-GPU machine, TGL can train one epoch of more than one billion temporal edges within 1-10 hours. To the best of our knowledge, this is the first work that proposes a general framework for large-scale Temporal Graph Neural Networks training on multiple GPUs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Poisson-Gamma Modeling of Inter-Relational Dependencies in Dynamic Knowledge Graphs

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A Gamma-Markov multi-relational Poisson model with an explicit relation-transition kernel improves sparse dynamic KG link prediction and recovers interpretable inter-relation dynamics.

  2. When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction

    cs.AI 2025-07 conditional novelty 6.0 of 10

    EAGLE predicts temporal links with top-k recent neighbors plus top-k shared temporal PageRank influencers, matching or beating transformer T-GNNs while running far faster.

  3. Non-exchangeable Conformal Prediction for Temporal Graph Neural Networks

    cs.LG 2025-07 reject novelty 4.0 of 10

    NCPNet applies non-exchangeable conformal prediction to temporal graphs by diffusing non-conformity scores over graph and time neighbors and learning weighted quantiles to reduce prediction set size.

  4. A Batch-Insensitive Dynamic GNN Approach to Address Temporal Discontinuity in Graph Streams

    cs.LG 2025-06 reject novelty 4.0 of 10

    BADGNN adds a Lipschitz regularizer and an attention-temperature adjustment so that memory-based dynamic GNNs can train with large batches while keeping predictive accuracy.

Pith tools