A Fair Evaluation of Graph Foundation Models for Node Property Prediction

• URL: http://arxiv.org/abs/2606.24509v1
• Date: Tue, 23 Jun 2026 12:41:43 GMT
• Title: A Fair Evaluation of Graph Foundation Models for Node Property Prediction
• Abstract summary: Graph Foundation Models (GFMs) are designed for node property prediction tasks.<n>This paper reevaluates 9 recent GFMs for node property prediction, comparing them to strong Graph Neural Network (GNN) baselines.<n>Among these GFMs, only the most recent ones based on the Prior-data Fitted Networks paradigm outperform well-tuned GNNs in predictive performance.
• Score: 13.518273106533657
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Due to the wide use of graph-structured data in different fields of industry and science, the development of Graph Foundation Models (GFMs) has recently attracted a lot of attention. While many different types of models are called GFMs, particular interest has been paid to GFMs designed for node property prediction tasks, which is one of the most popular settings in Graph ML with lots of real-world applications from fraud detection in financial and social networks to recommendation systems for e-commerce and user-generated content platforms. While a number of GFMs for this task have been recently proposed, the field has not converged to a unified evaluation setting, and different works evaluate their models in widely different ways, preventing reliable comparison of GFMs with each other and with other types of models. In this work, we conduct a fair and rigorous reevaluation of 9 recent GFMs for node property prediction, comparing them to strong Graph Neural Network (GNN) baselines. We find that, among these GFMs, only the most recent ones based on the Prior-data Fitted Networks paradigm outperform well-tuned GNNs in predictive performance, although at a higher inference cost.

Related papers

• Learning Graph Foundation Models on Riemannian Graph-of-Graphs [18.179624610878744]
  Graph foundation models (GFMs) are pretrained on massive graph data to support general-purpose reasoning.<n>We propose R-GFM, which treats structural scale as a first-class citizen in modeling.<n>R-GFM constructs a multi-scale GoG over-sampled subgraphs at different hop distances and learns geometry-adaptive representations.
  arXiv  Detail & Related papers  (2026-05-11T05:09:16Z)
• Turning Tabular Foundation Models into Graph Foundation Models [27.47522328312435]
  We propose G2T-FM, a framework for turning tabular foundation models into graph foundation models.<n>G2T-FM augments the original node features with neighborhood feature aggregation, adds structural embeddings, and then applies a TFM to the constructed node representations.<n>Our model achieves strong results, significantly outperforming publicly available GFMs and performing competitively with, and often better than, well-tuned GNNs trained from scratch.
  arXiv  Detail & Related papers  (2025-08-28T15:36:37Z)
• Towards Graph Foundation Models: A Transferability Perspective [48.4996946514573]
  Graph Foundation Models (GFMs) have gained significant attention for their potential to generalize across diverse graph domains and tasks.<n>To date, there has been no systematic research examining and analyzing GFMs from the perspective of transferability.<n>We present the first comprehensive taxonomy that categorizes and analyzes existing GFMs through the lens of transferability.
  arXiv  Detail & Related papers  (2025-03-12T13:04:05Z)
• GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation [83.72561905487447]
  We introduce GFM-RAG, a novel graph foundation model (GFM) for retrieval augmented generation.<n>GFM-RAG is powered by an innovative graph neural network that reasons over graph structure to capture complex query-knowledge relationships.<n>It achieves state-of-the-art performance while maintaining efficiency and alignment with neural scaling laws.
  arXiv  Detail & Related papers  (2025-02-03T07:04:29Z)
• PANGAEA: A Global and Inclusive Benchmark for Geospatial Foundation Models [3.9031647202359667]
  PANGAEA is a standardized evaluation protocol that covers a diverse set of datasets, tasks, resolutions, sensor modalities, and temporalities.<n>We evaluate the most popular GFMs openly available on this benchmark and analyze their performance across several domains.<n>Our findings highlight the limitations of GFMs, under different scenarios, showing that they do not consistently outperform supervised models.
  arXiv  Detail & Related papers  (2024-12-05T14:40:41Z)
• PROXI: Challenging the GNNs for Link Prediction [3.8233569758620063]
  We introduce PROXI, which leverages proximity information of node pairs in both graph and attribute spaces. Standard machine learning (ML) models perform competitively, even outperforming cutting-edge GNN models. We show that augmenting traditional GNNs with PROXI significantly boosts their link prediction performance.
  arXiv  Detail & Related papers  (2024-10-02T17:57:38Z)
• Position: Graph Foundation Models are Already Here [53.737868336014735]
  Graph Foundation Models (GFMs) are emerging as a significant research topic in the graph domain. We propose a novel perspective for the GFM development by advocating for a graph vocabulary'' This perspective can potentially advance the future GFM design in line with the neural scaling laws.
  arXiv  Detail & Related papers  (2024-02-03T17:24:36Z)
• GNNEvaluator: Evaluating GNN Performance On Unseen Graphs Without Labels [81.93520935479984]
  We study a new problem, GNN model evaluation, that aims to assess the performance of a specific GNN model trained on labeled and observed graphs. We propose a two-stage GNN model evaluation framework, including (1) DiscGraph set construction and (2) GNNEvaluator training and inference. Under the effective training supervision from the DiscGraph set, GNNEvaluator learns to precisely estimate node classification accuracy of the to-be-evaluated GNN model.
  arXiv  Detail & Related papers  (2023-10-23T05:51:59Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks [51.42338058718487]
  Graph Neural Networks (GNNs) have received extensive research attention for their promising performance in graph machine learning. Existing approaches, such as GCN and GPRGNN, are not robust in the face of homophily changes on test graphs. We propose EvenNet, a spectral GNN corresponding to an even-polynomial graph filter.
  arXiv  Detail & Related papers  (2022-05-27T10:48:14Z)
• Graph Neural Networks for Graphs with Heterophily: A Survey [98.45621222357397]
  We provide a comprehensive review of graph neural networks (GNNs) for heterophilic graphs. Specifically, we propose a systematic taxonomy that essentially governs existing heterophilic GNN models. We discuss the correlation between graph heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs.
  arXiv  Detail & Related papers  (2022-02-14T23:07:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.