arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.
arXiv:2607. 11374v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains.
Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains. Recent advancements in GFMs have been largely dominated by two paradigms: Graph Neural Network and Large Language Model (LLM) based methods.
arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
arXiv:2609.05955v1 Announce Type: new Abstract: Tabular foundation models have become powerful graph learners. Systems such as G2T-FM and GraphPFN encode each node as a feature row and make predictio...
Prior-data fitted networks (PFNs) show that pretraining on large populations of synthetic tasks can enable generalization to unseen datasets with little or no downstream fine-tuning. This paradigm is...
arXiv:2607. 19128v1 Announce Type: new Abstract: Vision-language models (VLMs) provide a unified representation space for textual and visual information, yet their potential as general-purpose backbones for graph-structured data remains largely unexplored.
arXiv:2609.37057v1 Announce Type: new Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...
The paper investigates whether prior‑data‑fitted networks (PFNs) can be extended to graph‑based relational models. The authors pretrain a message‑passing foundation model, Griffin, on large synthetic relational databases and evaluate its frozen encoder on 16 real‑world relational classification tasks. A curriculum that starts with schema‑guided synthetic data and then uses schema‑agnostic data yields the best in‑context performance, outperforming real‑data‑only pretraining and other mixtures.
The paper introduces PromptGFM, a Graph Foundation Model designed for text‑attributed graphs (TAGs). It integrates Large Language Models (LLMs) and Graph Neural Networks (GNNs) through a Graph Understanding Module that prompts LLMs to emulate GNN workflows, and a Graph Inference Module that creates a language‑based graph vocabulary for better alignment and scalability. Experiments show PromptGFM outperforms existing methods and transfers effectively across various graphs and tasks.
arXiv:2605.14907v2 Announce Type: replace Abstract: Knowledge graph (KG) foundation models aim to generalize to graphs with unseen entities and relations by learning transferable relational structure...