A Living Leaderboard for Graph Machine Learning
Organizations: Leipzig University, Germany
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.
Figures & tables
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
| Conference | 2022 | 2023 | 2024 |
|---|---|---|---|
| NeurIPS | 79.5% | 79.4% | 80.3% |
| ICLR | 80.4% | 83.1% | 84.2% |
| ICML | 83.0% | 84.2% | 80.2% |
| Method | Human | GLM-5.2 | Gemma-4-26B-A4B | Gemma-4-31B | GPT-OSS-120B | MiniMax-M3 | Llama-3.3-70B | Values match |
|---|---|---|---|---|---|---|---|---|
| APPNP | 0.7433 | 0.7433 | 0.7433 | 0.7433 | 0.7433 | 0.7433 | 0.7433 | ✓ |
| C&S 1-hop | 0.7428 | 0.7428 | 0.7428 | 0.7428 | 0.7428 | 0.7428 | 0.7428 | ✓ |
| C&S 2-hop | 0.7840 | 0.7840 | 0.7840 | 0.7840 | 0.7840 | 0.7840 | 0.7840 | ✓ |
| GAT | 0.8153 | 0.8153 | 0.8153 | 0.8153 | 0.8153 | 0.8153 | 0.8153 | ✓ |
| GATJK | 0.8069 | 0.8069 | 0.8069 | 0.8069 | 0.8069 | 0.8069 | 0.8069 | ✓ |
| GCN | 0.8247 | 0.8247 | 0.8247 | 0.8247 | 0.8247 | 0.8247 | 0.8247 | ✓ |
Graph Representation Learning
Graph representation learning develops methods for encoding nodes, edges, and whole graphs for prediction, comparison, and transfer.
See all 320 papers