Pith. sign in

REVIEW 2 cited by

TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics

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 2502.02975 v3 pith:6VNWVF7N submitted 2025-02-05 cs.LG cs.AI

classification cs.LGcs.AI
keywords dynamicssequentialtgb-seqnetworksbenchmarkdatasetsedgestemporal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Future link prediction is a fundamental challenge in various real-world dynamic systems. To address this, numerous temporal graph neural networks (temporal GNNs) and benchmark datasets have been developed. However, these datasets often feature excessive repeated edges and lack complex sequential dynamics, a key characteristic inherent in many real-world applications such as recommender systems and ``Who-To-Follow'' on social networks. This oversight has led existing methods to inadvertently downplay the importance of learning sequential dynamics, focusing primarily on predicting repeated edges. In this study, we demonstrate that existing methods, such as GraphMixer and DyGFormer, are inherently incapable of learning simple sequential dynamics, such as ``a user who has followed OpenAI and Anthropic is more likely to follow AI at Meta next.'' Motivated by this issue, we introduce the Temporal Graph Benchmark with Sequential Dynamics (TGB-Seq), a new benchmark carefully curated to minimize repeated edges, challenging models to learn sequential dynamics and generalize to unseen edges. TGB-Seq comprises large real-world datasets spanning diverse domains, including e-commerce interactions, movie ratings, business reviews, social networks, citation networks and web link networks. Benchmarking experiments reveal that current methods usually suffer significant performance degradation and incur substantial training costs on TGB-Seq, posing new challenges and opportunities for future research. TGB-Seq datasets, leaderboards, and example codes are available at https://tgb-seq.github.io/.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. T-GRAB: A Synthetic Diagnostic Benchmark for Learning on Temporal Graphs

    cs.LG 2025-07 conditional novelty 7.0 of 10

    T-GRAB, a set of three synthetic temporal-graph tasks, shows that no current TGNN reliably does counting, delayed cause-effect, or long-range spatio-temporal reasoning.

  2. TIDFormer: Exploiting Temporal and Interactive Dynamics Makes A Great Dynamic Graph Transformer

    cs.LG 2025-05 conditional novelty 5.0 of 10

    TIDFormer, a dynamic graph Transformer with interaction-level self-attention and three encoding modules, achieves the best or second-best average rank on seven CTDG link prediction benchmarks.

Pith tools