SCGFM-ART: Amortized Relational Transport for Structure-Centric Graph Foundation Models
Not on the map. Why?
Abstract (arXiv)
Graph foundation models (GFMs) aim to learn transferable representations across severely heterogeneous graph domains. However, severe domain shifts in topology, graph scale, and feature semantics impede the construction of a unified, domain-agnostic representation space. To address this, we propose SCGFM-ART, a structure-centric GFM framework that aligns arbitrary graphs onto a shared relational atlas via Amortized Relational Transport (ART). The relational atlas serves as a universal coordinate system defined by a finite set of relational landmarks (bases), while ART directly predicts reusable, end-to-end graph-to-base transport plans, bypassing costly runtime Gromov-Wasserstein optimizations. Under this formulation, SCGFM-ART decomposes a graph into a unified representation: globally via its relational response coordinates relative to the atlas, and locally via its node-to-role structural correspondences. These correspondences project disparate node attributes into a canonical role space, resolving structural and semantic heterogeneity within a singular alignment interface. Rigorously modeling graphs and atlas bases as finite measured relational spaces, we establish coordinate fidelity bounds, prove stability under predicted transport plans, and derive an amortized coverage bound that guarantees our learning objective tightly surrogates ideal relational coverage. Benchmarked across 14 cross-domain graph- and node-level classification tasks, SCGFM-ART achieves state-of-the-art transferability, securing superior average ranks of 2.29 and 1.14, respectively. Topological perturbation analyses demonstrate that node-role transport retains fine-grained structural nuances beyond global coordinates. On real-world benchmarks, the amortized formulation yields 44.2 to 85.1 times faster frozen target-domain inference by avoiding iterative alignment at test time.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 41 of its 53 references that are in the map. First posted on arXiv 17 Sep 2026.
Builds on
41 of 53 references.
References · 41
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Prototypical Networks for Few-shot Learningcited by 3,015
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
29 more
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2020Scaling Graph Neural Networks with Approximate PageRankcited by 174
- 2018Optimal Transport for structured data with application on graphscited by 172
- 2019Understanding Attention and Generalization in Graph Neural Networkscited by 169
- 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 126
- 2023Graph Foundation Models: Concepts, Opportunities and Challengescited by 103
- 2024Position: Graph Foundation Models are Already Herecited by 86
- 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 86
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
- 2025Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignmentcited by 42
- 2023Simple and Asymmetric Graph Contrastive Learning without Augmentationscited by 38
- 2025RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometrycited by 35
- 2024Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Treescited by 32
- 2022Meta Optimal Transportcited by 28
- 2024Learning Graph Quantized Tokenizerscited by 19
- 2024HIGHT: Hierarchical Graph Tokenization for Molecule-Language Alignmentcited by 17
- 2025GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuningcited by 13
- 2026Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Modelscited by 5
- 2026Structure-Centric Graph Foundation Model via Geometric Basescited by 5
- 2026RAG-GFM: Overcoming In-Memory Bottlenecks in Graph Foundation Models via Retrieval-Augmented Generationcited by 4
- 2026MDGMIX: Boundary-Aware Subgraph Mixing for Multi-Domain Graph Pre-Trainingcited by 1
- 2026Surprisingly Simple and Effective Multi-Domain Graph Foundation Model through Graph-to-Table Alignmentcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.