PaperScope
LIVE · 2026-11-03 05:40 UTC

A Living Leaderboard for Graph Machine Learning

Martin Ritzert

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2611.03433 v1
Category
Submitted
2026-11-02

Abstract

Graph machine learning benchmarking results are scattered across papers that use quite different sets of datasets and baseline methods, making it difficult to tell whether a reported gain reflects architectural progress or merely an outdated comparison or weakly tuned baseline. We introduce a living, graph-learning-specific leaderboard that organizes reported results by dataset, putting new results into context. As of 15 October 2026 our LLM-based extraction pipeline extracted 27,723 eligible results across 111 datasets from 885 peer-reviewed papers. Our analysis of these results quantifies concerns about graph-learning benchmarking: legacy datasets are still actively used and many result tables contain baseline results that are drastically lower than those already available in the literature, e.g. 45% Amazon-ratings tables and 37% for Peptides-struct. The leaderboard allows to quickly compare new results against compatible prior results, aiming to improve the overall quality of graph learning benchmarking.

Comment: The leaderboard is available at https://graphlearningbenchmarks.github.io , the code at https://github.com/martinalex000/benchmarking_website

arXiv abs page · PDF · same-day batch