LGMar 12, 2025

Towards Graph Foundation Models: A Transferability Perspective

arXiv:2503.09363v19 citationsh-index: 4
Originality Synthesis-oriented
AI Analysis

This work addresses the challenge of applying GFMs across diverse graph domains and tasks, but it is incremental as it provides a taxonomy rather than a new method.

The paper tackles the lack of systematic research on Graph Foundation Models (GFMs) by presenting the first comprehensive taxonomy that categorizes and analyzes existing GFMs from a transferability perspective, structuring them around application scope and knowledge transfer approaches.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes