Base3: a simple interpolation-based ensemble method for robust dynamic link prediction
Not on the map. Why?
Abstract (arXiv)
Dynamic link prediction remains a central challenge in temporal graph learning, particularly in designing models that are both effective and practical for real-world deployment. Existing approaches often rely on complex neural architectures, which are computationally intensive and difficult to interpret. In this work, we build on the strong recurrence-based foundation of the EdgeBank baseline, by supplementing it with inductive capabilities. We do so by leveraging the predictive power of non-learnable signals from two complementary perspectives: historical edge recurrence, as captured by EdgeBank, and global node popularity, as introduced in the PopTrack model. We propose t-CoMem, a lightweight memory module that tracks temporal co-occurrence patterns and neighborhood activity. Building on this, we introduce Base3, an interpolation-based model that fuses EdgeBank, PopTrack, and t-CoMem into a unified scoring framework. This combination effectively bridges local and global temporal dynamics -- repetition, popularity, and context -- without relying on training. Evaluated on the Temporal Graph Benchmark, Base3 achieves performance competitive with state-of-the-art deep models, even outperforming them on some datasets. Importantly, it considerably improves on existing baselines' performance under more realistic and challenging negative sampling strategies -- offering a simple yet robust alternative for temporal graph learning.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 13 of its 25 references that are in the map. First posted on arXiv 15 Jun 2025.
Builds on
13 of 25 references.
References · 13
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 138
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 122
- 2024Efficient Neural Common Neighbor for Temporal Graph Link Predictioncited by 18
- 2025On the Power of Heuristics in Temporal Graphscited by 11
1 more
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Self-Exploring Language Models for Explainable Link Forecasting on Temporal Graphs via Reinforcement Learningcited by 1
- 2026EdgeReMIND: A Scalable, Top-Ranked Memorization Baseline for Temporal Multi-Relational Link Predictioncited 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
- 2026EdgeReMIND: A Scalable, Top-Ranked Memorization Baseline for Temporal Multi-Relational Link Prediction15 Sep 2026
- 2025Self-Exploring Language Models for Explainable Link Forecasting on Temporal Graphs via Reinforcement Learning31 Aug 2025