English

Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees

Machine Learning 2025-05-27 v3 Artificial Intelligence Social and Information Networks

Abstract

Foundation models are pretrained on large-scale corpora to learn generalizable patterns across domains and tasks -- such as contours, textures, and edges in images, or tokens and sentences in text. In contrast, discovering such generalities in graph-structured data, especially across heterogeneous graph tasks, remains an open challenge. To address this, we propose a novel approach to cross-task generalization in graphs via task-trees, which serve as unified learning instances aligning node-, edge-, and graph-level tasks. We theoretically analyze the stability, transferability, and generalization properties of task-trees, showing that pretraining a graph neural network (GNN) on diverse task-trees with a reconstruction objective induces transferable knowledge. This enables efficient adaptation to downstream tasks with minimal fine-tuning. To validate our framework, we introduce Graph Generality Identifier on Task-Trees (GIT), a graph foundation model that demonstrates strong performance on over 30 graphs across five domains via fine-tuning, in-context learning, and zero-shot generalization. Code and data are available at https://github.com/Zehong-Wang/GIT.

Keywords

Cite

@article{arxiv.2412.16441,
  title  = {Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees},
  author = {Zehong Wang and Zheyuan Zhang and Tianyi Ma and Nitesh V Chawla and Chuxu Zhang and Yanfang Ye},
  journal= {arXiv preprint arXiv:2412.16441},
  year   = {2025}
}

Comments

Accepted by ICML 2025

R2 v1 2026-06-28T20:44:38.907Z