FedBook: A Unified Federated Graph Foundation Codebook with Intra-domain and Inter-domain Knowledge Modeling
Abstract
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 graphs, which is often infeasible due to privacy and institutional constraints. Federated Graph Foundation Models (FedGFMs) address this limitation, but their effectiveness fundamentally hinges on constructing a robust global codebook that achieves intra-domain coherence by consolidating mutually reinforcing semantics within each domain, while also maintaining inter-domain diversity by retaining heterogeneous knowledge across domains. To this end, we propose FedBook, a unified federated graph foundation codebook that systematically aggregates clients’ local codebooks during server-side federated pre-training. FedBook follows a two-phase process: (1), where low-frequency tokens are refined by referencing more semantically reliable high-frequency tokens across clients to enhance domain-specific coherence; and (2), where client contributions are weighted by the semantic distinctiveness of their codebooks during the aggregation of the global GFM, thereby preserving cross-domain diversity. Extensive experiments on 8 benchmarks across multiple domains and tasks demonstrate that FedBook consistently outperforms 21 baselines, including isolated supervised learning, FL/FGL, federated adaptations of centralized GFMs, and FedGFM techniques.
Benchmark Results
Tested on 3 datasets 14 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 9 | SAGE | 0.8771 | |
| 31 | GAT | 0.8533 best reported | |
| 54 | GIN | 0.8303
±0.0021 best reported | |
| 69 | GraphSAGE | 0.8146
±0.0010 best reported | |
| 152 | FedSage | 0.7864
±0.0034 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 154 | FedGTA | 0.7860
±0.0024 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 166 | FED-PUB | 0.7832
±0.0043 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 169 | FedTAD | 0.7822
±0.0027 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 187 | FedAvg | 0.7767
±0.0013 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 191 | MOON | 0.7754
±0.0024 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
| 214 | FGSSL | 0.7662
±0.0041 | prev best: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) Improvement within reported uncertainty; not highlighted. |
| 237 | MLP | 0.7469
±0.0085 | |
| 240 | Linear | 0.7438
±0.0016 best reported | best at pub: Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement (NeurIPS 2025) |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GIANT-XRT | 0.7612
±0.0016 | |
| 2 | GEGCN | 0.7576
±0.0064 | |
| 3 | AGDN | 0.7522
±0.0007 | |
| 13 | FGSSL | 0.7377
±0.0030 | This paper |
| 15 | GAT | 0.7365
±0.0011 best reported | best at pub: Fully-inductive Node Classification on Arbitrary Graphs (ICLR 2024) |
| 18 | FedTAD | 0.7352
±0.0039 | This paper |
| 19 | FedSage | 0.7333
±0.0048 | This paper |
| 20 | FedGTA | 0.7320
±0.0022 | This paper |
| 21 | FED-PUB | 0.7319
±0.0022 | This paper |
| 23 | GCN | 0.7300
±0.0017 best reported | |
| 25 | GraphSAGE | 0.7277
±0.0016 best reported | |
| 26 | SAGE | 0.7267
±0.0031 | |
| 38 | MOON | 0.7212
±0.0033 | This paper |
| 73 | FedAvg | 0.7103
±0.0025 | This paper |
| 81 | GIN | 0.6893
±0.0020 | prev best: Learning Conjoint Attentions for Graph Neural Nets (NeurIPS 2021) best today: RADE: Random Add-Drop Edge as a Regularizer (ICML 2026) |
| 97 | Linear | 0.6628
±0.0010 | This paper |
| 107 | MLP | 0.5765
±0.0012 |
Knowledge Graphs
| # | Model | MRR ↑ | Paper |
|---|---|---|---|
| 1 | FedSage | 0.8426
±0.0026 | This paper |
| 2 | FED-PUB | 0.8348
±0.0025 | This paper |
| 3 | FedAvg | 0.8252
±0.0023 | This paper |
| 4 | GAT | 0.8244
±0.0037 | prev best: GFT: Graph Foundation Model with Transferable Tree Vocabulary (NeurIPS 2024) |
| 5 | MOON | 0.8231
±0.0025 | This paper |
| 6 | Linear | 0.8225
±0.0023 | prev best: GFT: Graph Foundation Model with Transferable Tree Vocabulary (NeurIPS 2024) |
| 7 | GCN | 0.8171
±0.0030 | prev best: GFT: Graph Foundation Model with Transferable Tree Vocabulary (NeurIPS 2024) |
| 8 | GraphSAGE | 0.8152
±0.0024 | This paper |
| 9 | GIN | 0.8124
±0.0055 | This paper |
