EdgeReMIND: A Scalable, Top-Ranked Memorization Baseline for Temporal Multi-Relational Link Prediction

📅 2026-09-15
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
EdgeReMIND通过线性记忆模型解决了TGB 2.0基准测试中时间多关系链接预测的可扩展性问题,适用于所有数据集,并取得最佳表现。
📝 Abstract
Temporal link prediction on the Temporal Graph Benchmark 2.0 (TGB 2.0) faces a scalability ceiling: on the benchmark's three largest datasets, every existing embedding method runs out of memory or exceeds the time budget. These large-scale graphs are the ones nearest real deployment scale, so failing on them is a real production limitation. EdgeReMIND sets the highest reported test mean reciprocal rank (MRR) on six of eight TGB 2.0 datasets and is the only relation-aware method that runs on all of them. This linear memorization model, with learned per-relation weights over data-calibrated features, is therefore not merely a fallback where embeddings fail but a practical state-of-the-art baseline across the benchmark.
Problem

Research questions and friction points this paper is trying to address.

Temporal Link Prediction
Scalability
Memory Limitation
Time Budget
Innovation

Methods, ideas, or system contributions that make the work stand out.

Scalable Memorization
Temporal Multi-Relational Link Prediction
Linear Model
Relation-Aware
TGB 2.0
🔎 Similar Papers
B
Bryant Pollard
Clemson University