Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Foundation models have achieved great success in natural language processing (NLP) and computer vision (CV). Their success largely stems from the ability to integrate multi-domain knowledge in pre-training and transfer it to target domains. Considering graph data, especially graphs without textual features, is ubiquitous in real-world applications such as social networks and recommendation systems, some researchers have attempted to extend this paradigm to the graph field, aiming to construct graph foundation models. However, unlike CV and NLP, there are huge gaps among the semantics and properties of graphs in different domains, while current works still adopt traditional contrastive pre-training strategies designed in the single-domain scenario, which regard contrastive samples from different domains as equivalent. From experimental investigations, we discovered that inherent domain-specific differences prevent these strategies from effectively absorbing knowledge from different domains to generate informative representations. In this paper, we propose a novel multi-domain pre-training and cross-domain transfer framework, namely MDGCL.In the pre-training stage, we design a contrastive learning strategy to substantially recognize and capture domain differences, and introduce domain tokens to encode domain-level global information. In the downstream stage, we introduce a domain attention mechanism to enable fine-grained domain knowledge transfer. Extensive experiments on five benchmark datasets have demonstrated that our method outperforms state-of-the-art significantly, with the maximum improvement of 19.33% on accuracy and 19.13% on Macro-F1 score.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 33 of its 42 references that are in the map. First posted on arXiv 26 Jun 2025.
Builds on
33 of 42 references.
References · 33
- 2023GPT-4 Technical Reportcited by 18,396
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2015Image-based Recommendations on Styles and Substitutescited by 706
- 2021ImageNet-21K Pretraining for the Massescited by 613
- 2019Multi-scale Attributed Node Embeddingcited by 548
21 more
- 2019Graph Transformer Networkscited by 523
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
- 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2023GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networkscited by 167
- 2022Learning on Large-scale Text-attributed Graphs via Variational Inferencecited by 155
- 2023All in One: Multi-task Prompting for Graph Neural Networkscited by 148
- 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
- 2022Understanding and Improving Visual Prompting: A Label-Mapping Perspectivecited by 87
- 2023Towards Foundation Models for Knowledge Graph Reasoningcited by 86
- 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 86
- 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
- 2024OpenGraph: Towards Open Graph Foundation Modelscited by 78
- 2023Augmenting Low-Resource Text Classification with Graph-Grounded Pre-training and Promptingcited by 62
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
- 2024HiGPT: Heterogeneous Graph Language Modelcited by 45
- 2024Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insightscited by 44
- 2024The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challengescited by 29
- 2023Selectivity Drives Productivity: Efficient Dataset Pruning for Enhanced Transfer Learningcited by 11
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Modelscited by 5
- 2026Decoupled and Divergence-Conditioned Prompt for Multi-domain Dynamic Graph Foundation Modelscited by 1
- 2026Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundlescited by 0
- 2026Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles2 Jun 2026
- 2026Decoupled and Divergence-Conditioned Prompt for Multi-domain Dynamic Graph Foundation Models13 May 2026
- 2026Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Models28 Feb 2026