More Domains, No Gains? FLO: Fast-Slow Reciprocal Learning for Multi-Domain Graph Pre-training
Not on the map. Why?
Abstract (arXiv)
Inspired by the great success of foundation models in the development of artificial general intelligence, Graph Foundation Models (GFMs) have recently attracted significant attention and have the potential to advance graph intelligence. Exhibiting such intelligence requires effectively learning knowledge from large-scale, multi-domain graph data during pre-training. Increasing domain diversity during pre-training is expected to yield richer and more generalizable knowledge. Most existing methods pursue this goal by designing domain alignment strategies that help a single graph model learn from multiple domains. However, we observe that existing methods struggle to benefit from increasing domain diversity. Through empirical and theoretical analysis, we reveal two key limitations. Firstly, pre-training in most GFMs is confined to a single message-passing paradigm. Since propagation flattens relations among neighboring nodes, the graph model can hardly perceive the knowledge beyond propagation, namely the attribute-predictable component of these relations. Secondly, domain alignment strategies often rely on randomly initialized parameters that are jointly updated with the graph model using immediate loss feedback, leaving early knowledge acquisition vulnerable to cross-domain interference. To address these issues, we propose FLO, a Fast--sLow reciprOcal approach for multi-domain graph pre-training. Specifically, a propagation-free attribute branch predicts the graph model's relations without message passing and returns these predictions to refine the model. We further stabilize knowledge acquisition by pairing a fast process that adapts to the current domain with a slow process that integrates knowledge across domains. On 12 datasets, FLO benefits from increasing domain diversity and achieves the best average performance in cross-domain and cross-task transfer.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 55 of its 66 references that are in the map. First posted on arXiv 10 Oct 2026.
Builds on
55 of 66 references.
References · 55
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2019Strategies for Pre-training Graph Neural Networkscited by 971
- 2019Relational Knowledge Distillationcited by 889
38 more
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
- 2017Deep Mutual Learningcited by 628
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
- 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 186
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 152
- 2021SEED: Self-supervised Distillation For Visual Representationcited by 134
- 2020Distilling Knowledge from Graph Convolutional Networkscited by 129
- 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 112
- 2023Graph Foundation Models: Concepts, Opportunities and Challengescited by 103
- 2024Position: Graph Foundation Models are Already Herecited by 86
- 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 86
- 2024ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphscited by 85
- 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
- 2021ReSSL: Relational Self-Supervised Learning with Weak Augmentationcited by 84
- 2024Exponential Moving Average of Weights in Deep Learning: Dynamics and Benefitscited by 71
- 2022Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminationcited by 69
- 2024UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphscited by 66
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
- 2024AnyGraph: Graph Foundation Model in the Wildcited by 53
- 2024Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Modelscited by 42
- 2025Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignmentcited by 42
- 2024Fully-inductive Node Classification on Arbitrary Graphscited by 39
- 2025RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometrycited by 35
- 2023GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learningcited by 33
- 2024Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Treescited by 32
- 2023How to Scale Your EMAcited by 24
- 2022FreeKD: Free-direction Knowledge Distillation for Graph Neural Networkscited by 23
- 2024TINED: GNNs-to-MLPs by Teacher Injection and Dirichlet Energy Distillationcited by 5
- 2026MUG: Meta-path-aware Universal Heterogeneous Graph Pre-Trainingcited by 5
- 2026Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Modelscited by 5
50 most cited of 55 All 55 (JSON)
Built on by
Not cited yet.