Graph Foundation Models:
A New Era for Graph Machine Learning
Date: July 10th | Location: Seoul, South Korea
Date: July 10th | Location: Seoul, South Korea
Graph machine learning (GML) applies ML to structured data represented as nodes and edges, and underpins applications such as fraud detection, recommendation, drug discovery, weather prediction, and traffic forecasting. The prevailing practice trains a task-specific GNN per dataset: a data-hungry, compute-intensive workflow brittle to shifts in structure, features, or labels. In contrast, foundation models in language, vision, and audio transfer broadly with minimal tuning.
Graph foundation models (GFMs) extend this paradigm to graphs: pre-train once, then adapt across node/edge/graph tasks, feature/label spaces, and dynamic or multimodal settings. Methodological explorations span GNN-based backbones, Transformers, and LLM pipelines. Industry momentum signals practical readiness and a shift toward graph-centric modeling. Despite progress, key gaps remain:
Methodology: no consensus on model families, objectives, or pretraining for heterogeneous, dynamic, and multimodal graphs;
Scaling: limited understanding of data regimes, generalization and transferability to (large) graphs;
Evaluation: fragmented benchmarks, metrics, and protocols hinder fair comparison;
Transfer: unclear pathways to adapt language/vision/table techniques and generalize across schemas, label spaces, and tasks.
The goals of our workshop are to build a connected academia–industry community; Identify challenges and opportunities for GFMs, i.e. handling heterogeneity, scaling to massive graphs, and effective pretraining.; Standardize evaluation via shared datasets, metrics, protocols, and baselines.; and catalyze cross-domain transfer from language, vision, and tables, adapted to graph structure.
We welcome contributions on topics central to graph foundation models. The list below is not exhaustive, and we encourage submissions in related and emerging areas.
Graph learning with LLMs: LLMs for graph tasks; GFMs that interface with language models and retrieval, agentic planning, and tool use for graph reasoning.
Graph learning with Tabular Foundation Models (TFMs): TFMs for graph and relational database tasks, Tabularization techniques; training TFMs with graph priors.
New GFMs: New architectures, training objectives, scaling laws and strategies, graph tokenization, structural and positional encodings, prompting and in-context learning for graphs.
Domain-specific GFMs: GFMs for knowledge graphs, temporal graphs, and heterogeneous graphs, biological and molecular discovery, relational databases, recommendation systems, social networks, traffic networks, cybersecurity, and finance.
Theoretical advancements: Transferability, generalization, and expressivity analysis. Interpretability and explainability of GFM representations.
Benchmarking GFMs: Standardized benchmarks, metrics, and evaluation protocols, leaderboards, open source libraries, and reproducible pipelines.
We invite long papers (up to 8 pages) for mature, full-length contributions with extensive results and analysis and position papers (2–4 pages) offering concise, opinionated perspectives on defining/deploying GFMs, GFM–LLM/GFM-TFM integration, benchmarking, and lessons from other foundation model domains.
We will manage the paper submission through OpenReview, and the review process is double-blind. Please use the ICML 2026 LaTeX style files. We will select outstanding papers for oral talks, and the award for the best paper will be announced at the workshop. Any LLM involvement must be explicitly disclosed; human authors and reviewers remain fully responsible for all content. AI-generated papers will not be accepted.
Note: This workshop will be non-archival. Dual submissions with papers under review at other venues are permitted.
May 8th, 2026 Paper Submission Deadline
May 21st, 2026 Author Notification
July 10th, 2026 Workshop@ICML
Michael Galkin
Google Research
Noah Hollmann
Prior Labs
Myunghwan Kim
Nvidia
Ismail Ilkan Ceylan
TU Wein & AITHYRA
Shenyang Huang
University of Oxford
Christopher Morris
RWTH Aachen University
Liudmila Prokhorenkova
Yandex Research
Pan Li
Georgia Tech
Yixuan He
ASU
08:00 Opening Remarks
08:15 Invited Talk 1: Shenyang (Andy) Huang, Temporal Graph Foundation Models: Challenges and Opportunities
09:00 Invited Talk 2: Mikhail Galkin, Graph Learning at Google in 2026
09:45 Coffee Break
10:00 Oral Presentations 1 & 2
10:40 Invited Talk 3: Myunghwan Kim, Relational Foundation Model
11:25 Panel Discussion
12:10 Lunch Break / Poster Session
14:00 Invited Talk 4: İsmail Ceylan, What Transfers Across Graphs, Relations, and Tasks?
14:45 Invited Talk 5: Noah Hollmann, Structured Foundation Models: From Tables to Graphs
15:30 Coffee Break
15:45 Oral Presentations 3 & 4 & 5
16:45 Closing Remarks
Xingyue Huang
University of Oxford
Ben Finkelshtein
University of Oxford
Charilaos Kanatsoulis
Stanford University
Xiaoxin He
Meta & NUS
Xueying Ding
CMU
Reihaneh Rabbany
University of McGill & Mila
Michael Bronstein
University of Oxford & AITHYRA