Towards Graph Foundation Models: A Transferability Perspective
Yuxiang Wang, Wenqi Fan, Suhang Wang, Yao Ma
TL;DR
This paper addresses the transferability of Graph Foundation Models (GFMs) across diverse graph domains and tasks. It introduces a transferability-centric taxonomy that segregates GFMs into domain-specific and general-purpose categories and frames their analysis around a three-component life cycle: Backbone Model, Knowledge Acquisition, and Knowledge Transfer. The survey systematically examines backbone architectures (GNNs, Transformers, LLMs, and hybrids) and knowledge strategies (subgraph sampling, SVD alignment, PLM-based semantic alignment, graph prompts, meta-learning, and PEFT) to illuminate how transferability is achieved and where challenges remain. It also outlines future directions, including the integration of LLMs with graph models and the need for standardized benchmarking to gauge cross-domain and cross-task performance.
Abstract
In recent years, Graph Foundation Models (GFMs) have gained significant attention for their potential to generalize across diverse graph domains and tasks. Some works focus on Domain-Specific GFMs, which are designed to address a variety of tasks within a specific domain, while others aim to create General-Purpose GFMs that extend the capabilities of domain-specific models to multiple domains. Regardless of the type, transferability is crucial for applying GFMs across different domains and tasks. However, achieving strong transferability is a major challenge due to the structural, feature, and distributional variations in graph data. To date, there has been no systematic research examining and analyzing GFMs from the perspective of transferability. To bridge the gap, we present the first comprehensive taxonomy that categorizes and analyzes existing GFMs through the lens of transferability, structuring GFMs around their application scope (domain-specific vs. general-purpose) and their approaches to knowledge acquisition and transfer. We provide a structured perspective on current progress and identify potential pathways for advancing GFM generalization across diverse graph datasets and tasks. We aims to shed light on the current landscape of GFMs and inspire future research directions in GFM development.
