Graph Foundation Models: The Pretrained Graph We Never Had
Graph Foundation Models: The Pretrained Graph We Never Had
For a decade, graph machine learning suffered from a structural handicap: every graph was a bespoke training problem. GNNs needed a task, a split and a training run per domain. Meanwhile language models became pretrained once and reused everywhere. The gap between those two worlds — "I have a model that can read any text" versus "I have a model that can read this one graph" — is exactly what graph foundation models (GFMs) are meant to close. In 2026 the research has shifted from arguing whether GFMs exist to arguing how they should be built — and the number of credible, cross-domain GFMs published in the last two months is the strongest signal the idea has arrived.
The unification battle: three architectures
The current literature converges on three designs, and the differences matter for practitioners:
1. Unified encoders via graph-to-text/table
The most surprising result of the summer is that you do not need a new neural architecture at all — you need a better format. Surprisingly Simple and Effective Multi-Domain Graph Foundation Model through Graph-to-Table Alignment trains a foundation model by aligning graphs to tabular/text views, and achieves cross-domain transfer without heavy graph-specific machinery. Node4All goes further: "learning node representation beyond datasets" — a single representation space that any new graph's nodes can be mapped into.
2. Heterograph transformers
Canopy — "A Heterograph Foundation Model for Metabolic Engineering" — is the concrete domain proof: a foundation model trained over biological heterographs that transfers to engineering tasks. What Makes Graph Unified? provides the principles paper, proposing a generative sliding-window transformer design that can handle diverse graph vocabularies in one architecture.
3. Node-agent information flow
AgentGFM is the wildcard: a graph foundation model where each node acts like an agent with controlled information flow — turning the graph itself into a distributed reasoning system rather than a fixed readout.
What transfer actually means
The measurable claim behind all of this is few-shot cross-domain transfer. Instead of training a GNN from scratch on your private graph, you:
- Map your graph into the GFM's input format (tables, tokens, or a heterograph schema);
- Prompt or fine-tune lightly;
- Get strong performance with orders-of-magnitude less labelled data.
Beyond Feature and Structure Alignment shows that the transferable component is not node features or topology per se but the — information should flow — which is precisely what a foundation model can amortise across domains. adds retrieval-augmented generalisation: pulling the right prior subgraph at inference time so the model behaves sensibly on graphs it has never seen.