paper-with-me

홈 › Papers

Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement

2025-05-19 · Yinlin Zhu, Xunkai Li, Jishuo Jia, Miao Hu, Di wu, Meikang Qiu

Recent advances in graph machine learning have shifted to data-centric paradigms, driven by two emerging fields: (1) Federated graph learning (FGL) enables multi-client collaboration but faces challenges from data and task heterogeneity, limiting its practicality; (2) Graph foundation models (GFM) offer strong domain generalization but are usually trained on single machines, missing out on cross-silo data and resources. These paradigms are complementary, and their integration brings notable benefits. Motivated by this, we propose FedGFM, a novel decentralized GFM training paradigm. However, a key challenge is knowledge entanglement, where multi-domain knowledge merges into indistinguishable representations, hindering downstream adaptation. To address this, we present FedGFM+, an enhanced framework with two core modules to reduce knowledge entanglement: (1) AncDAI: A global anchor-based domain-aware initialization strategy. Before pre-training, each client encodes its local graph into domain-specific prototypes that serve as semantic anchors. Synthetic embeddings around these anchors initialize the global model. We theoretically prove these prototypes are distinguishable across domains, providing a strong inductive bias to disentangle domain-specific knowledge. (2) AdaDPP: A local adaptive domain-sensitive prompt pool. Each client learns a lightweight graph prompt capturing domain semantics during pre-training. During fine-tuning, prompts from all clients form a pool from which the GFM selects relevant prompts to augment target graph attributes, improving downstream adaptation. FedGFM+ is evaluated on 8 diverse benchmarks across multiple domains and tasks, outperforming 20 baselines from supervised learning, FGL, and federated GFM variants.

📄 PDF Abstract BibTeX arXiv:2505.12684

Code (0)

등록된 구현이 없습니다.

Tasks

Domain GeneralizationGraph LearningInductive Bias

Similar Papers 제목 키워드 기반

Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach

2026-01-29 · Yinlin Zhu, Di Wu, Xianzhi Zhang, Yuming Ai 외 arxiv

Recent studies of federated graph foundational models (FedGFMs) break the idealized and untenable assumption of having centralized data storage to train graph foundation models, and accommodate the reality of distributed…

Contrastive LearningGeneral Knowledge

FedBook: A Unified Federated Graph Foundation Codebook with Intra-domain and Inter-domain Knowledge Modeling

2025-10-09 · Zhengyu Wu, Yinlin Zhu, Xunkai Li, Ziang Qiu 외 arxiv

Foundation models have shown remarkable cross-domain generalization in language and vision, inspiring the development of graph foundation models (GFMs). However, existing GFMs typically assume centralized access to multi…

Domain Generalization

Federated Low-Rank Adaptation for Foundation Models: A Survey

2025-05-16 · Yiyuan Yang, Guodong Long, Qinghua Lu, Liming Zhu 외

Effectively leveraging private datasets remains a significant challenge in developing foundation models. Federated Learning (FL) has recently emerged as a collaborative framework that enables multiple users to fine-tune …

Federated LearningSurvey

FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning

2026-06-30 · Zekai Chen, Kairui Yang, Xuaner Chen, Xunkai Li 외 arxiv

Multimodal graph foundation models aim to learn reusable knowledge from graphs enriched with text, images, attributes, and relational topology, thereby supporting diverse graph-centric and modality-centric tasks. In prac…

Representation Learning

Bi-level Personalization for Federated Foundation Models: A Task-vector Aggregation Approach

2025-09-16 · Yiyuan Yang, Guodong Long, Qinghua Lu, Liming Zhu 외 arxiv

Federated foundation models represent a new paradigm to jointly fine-tune pre-trained foundation models across clients. It is still a challenge to fine-tune foundation models for a small group of new users or specialized…