Future Link Prediction Without Memory or Aggregation
Not on the map. Why?
Abstract (arXiv)
Future link prediction on temporal graphs is a fundamental task with wide applicability in real-world dynamic systems. These scenarios often involve both recurring (seen) and novel (unseen) interactions, requiring models to generalize effectively across both types of edges. However, existing methods typically rely on complex memory and aggregation modules, yet struggle to handle unseen edges. In this paper, we revisit the architecture of existing temporal graph models and identify two essential but overlooked modeling requirements for future link prediction: representing nodes with unique identifiers and performing target-aware matching between source and destination nodes. To this end, we propose Cross-Attention based Future Link Predictor on Temporal Graphs (CRAFT), a simple yet effective architecture that discards memory and aggregation modules and instead builds on two components: learnable node embeddings and cross-attention between the destination and the source's recent interactions. This design provides strong expressive power and enables target-aware modeling of the compatibility between candidate destinations and the source's interaction patterns. Extensive experiments on diverse datasets demonstrate that CRAFT consistently achieves superior performance with high efficiency, making it well-suited for large-scale real-world applications.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
32 of 48 references.
References · 32
- 2017Attention Is All You Needcited by 60,361
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,446
- 2018Self-Attentive Sequential Recommendationcited by 1,184
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
- 2019What graph neural networks cannot learn: depth vs widthcited by 201
- 2020The Surprising Power of Graph Neural Networks with Random Node Initializationcited by 198
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 193
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
20 more
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 138
- 2020Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A surveycited by 124
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 122
- 2018Streaming Graph Neural Networkscited by 91
- 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 68
- 2022Neighborhood-aware Scalable Temporal Network Representation Learningcited by 54
- 2022TREND: TempoRal Event and Node Dynamics for Graph Representation Learningcited by 50
- 2023Revisiting Link Prediction: A Data Perspectivecited by 29
- 2024A survey of dynamic graph neural networkscited by 24
- 2024On the Feasibility of Simple Transformer for Dynamic Graph Modelingcited by 22
- 2025TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamicscited by 15
- 2017Stream Graphs and Link Streams for the Modeling of Interactions over Timecited by 14
- 2019Learning Temporal Attention in Dynamic Graphs with Bilinear Interactionscited by 11
- 2023HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformerscited by 10
- 2023An Empirical Evaluation of Temporal Graph Benchmarkcited by 8
- 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)cited by 5
- 2024Machine Learning on Dynamic Graphs: A Survey on Applicationscited by 4
- 2025Towards Invariance to Node Identifiers in Graph Neural Networkscited by 4
- 2024Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU Hourscited by 2
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Sequence Diffusion Model for Temporal Link Prediction in Continuous-Time Dynamic Graphcited by 1
- 2026Where Does Neural Advantage Arise in Continuous-Time Dynamic Graph Prediction?cited by 1
- 2026What Softmax Throws Away: Mass-Aware Attention for Evidence Accumulationcited by 0
- 2026Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphscited by 0
- 2026Do Temporal Link Predictors Need Learned Memory? A Smoothed-Count Baseline with a Handful of Parameterscited by 0
- 2026Do Temporal Link Predictors Need Learned Memory? A Smoothed-Count Baseline with a Handful of Parameters28 Sep 2026
- 2026Where Does Neural Advantage Arise in Continuous-Time Dynamic Graph Prediction?7 Aug 2026
- 2026Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs30 Jul 2026
- 2026What Softmax Throws Away: Mass-Aware Attention for Evidence Accumulation24 Jul 2026
- 2026Sequence Diffusion Model for Temporal Link Prediction in Continuous-Time Dynamic Graph30 Jan 2026