Are We Really Measuring Progress? Transferring Insights from Evaluating Recommender Systems to Temporal Link Prediction

Filip Cornell, Oleg Smirnov, Gabriela Zarzar Gandler, Lele Cao
6/14/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Recent work has questioned the reliability of graph learning benchmarks, citing concerns around task design, methodological rigor, and data suitability. In this extended abstract, we contribute to this discussion by focusing on evaluation strategies in Temporal Link Prediction (TLP). We observe that current evaluation protocols are often affected by one or more of the following issues: (1) inconsistent sampled metrics, (2) reliance on hard negative sampling often introduced as a means to improve robustness, and (3) metrics that implicitly assume equal base probabilities across source nodes by combining predictions. We support these claims through illustrative examples and connections to longstanding concerns in the recommender systems community. Our ongoing work aims to systematically characterize these problems and explore alternatives that can lead to more robust and interpretable evaluation. We conclude with a discussion of potential directions for improving the reliability of TLP benchmarks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cornell2025really,
  title  = {Are We Really Measuring Progress? Transferring Insights from Evaluating Recommender Systems to Temporal Link Prediction},
  author = {Filip Cornell and Oleg Smirnov and Gabriela Zarzar Gandler and Lele Cao},
  year   = {2025},
  eprint = {2506.12588},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.12588v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.12588.svg)](https://codeofpaper.com/paper/2506.12588)

Discussion