mlsanityData to 14 Oct 2026

Evaluating Progress in Graph Foundation Models: A Comprehensive Benchmark and New Insights

arXiv 2603.10033 ↗First posted 28 Feb 2026cs.CL cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Graph foundation models (GFM) aim to acquire transferable knowledge by pre-training on diverse graphs, which can be adapted to various downstream tasks. However, domain shift in graphs is inherently two-dimensional: graphs differ not only in what they describe (topic domains) but also in how they are represented (format domains). Most existing GFM benchmarks vary only topic domains, thereby obscuring how knowledge transfers across both dimensions. We present a new benchmark that jointly evaluates topic and format gaps across the full GFM pipeline, including multi-domain self-supervised pre-training and few-shot downstream adaptation, and provides a timely evaluation of recent GFMs in the rapidly evolving landscape. Our protocol enables controlled assessment in four settings: (i) pre-training on diverse topics and formats, while adapting to unseen downstream datasets; (ii) same pre-training as in (i), while adapting to seen datasets; (iii) pre-training on a single topic domain, while adapting to other topics; (iv) pre-training on a base format, while adapting to other formats. This two-axis evaluation disentangles semantic generalization from robustness to representational shifts. We conduct extensive evaluations of eight state-of-the-art GFMs on 33 datasets spanning seven topic domains and six format domains, surfacing new empirical observations and practical insights for future research. Codes/data are available at https://github.com/smufang/GFMBenchmark.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 49 of its 79 references that are in the map. First posted on arXiv 28 Feb 2026.

Builds on

49 of 79 references.

References · 49

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2017Graph Attention Networkscited by 8,923
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2018Deep Graph Infomaxcited by 1,106
  7. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  8. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
  9. 2021Florence: A New Foundation Model for Computer Visioncited by 804
  10. 2019Heterogeneous Graph Attention Networkcited by 734
  11. 2017Convolutional 2D Knowledge Graph Embeddingscited by 730
  12. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
37 more
  1. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  2. 2019Multi-scale Attributed Node Embeddingcited by 548
  3. 2022InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutionscited by 482
  4. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
  5. 2018Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generationcited by 364
  6. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
  7. 2019KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representationcited by 356
  8. 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 303
  9. 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 274
  10. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
  11. 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
  12. 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 187
  13. 2024LLaGA: Large Language and Graph Assistantcited by 181
  14. 2021Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networkscited by 176
  15. 2022Learning on Large-scale Text-attributed Graphs via Variational Inferencecited by 155
  16. 2021Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learningcited by 130
  17. 2020A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sourcescited by 126
  18. 2023Graph Foundation Models: Concepts, Opportunities and Challengescited by 103
  19. 2023PRODIGY: Enabling In-context Learning Over Graphscited by 98
  20. 2019Representation Learning for Attributed Multiplex Heterogeneous Networkcited by 91
  21. 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 90
  22. 2024Position: Graph Foundation Models are Already Herecited by 86
  23. 2024ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphscited by 85
  24. 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
  25. 2017Dynamic Graph Convolutional Networkscited by 83
  26. 2025Organize the Web: Constructing Domains Enhances Pre-Training Data Curationcited by 76
  27. 2023Augmenting Low-Resource Text Classification with Graph-Grounded Pre-training and Promptingcited by 62
  28. 2025UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphscited by 49
  29. 2024Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Modelscited by 42
  30. 2025Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignmentcited by 42
  31. 2023Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphscited by 39
  32. 2024Non-Homophilic Graph Pre-Training and Prompt Learningcited by 31
  33. 2025GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuningcited by 13
  34. 2021The Physics of Financial Networkscited by 6
  35. 2025HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphscited by 5
  36. 2024GraphFM: A Comprehensive Benchmark for Graph Foundation Modelcited by 4
  37. 2025RoFt-Mol: Benchmarking Robust Fine-Tuning with Molecular Graph Foundation Modelscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.