FedGKD: Unleashing the Power of Collaboration in Federated Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Federated training of Graph Neural Networks (GNN) has become popular in recent years due to its ability to perform graph-related tasks under data isolation scenarios while preserving data privacy. However, graph heterogeneity issues in federated GNN systems continue to pose challenges. Existing frameworks address the problem by representing local tasks using different statistics and relating them through a simple aggregation mechanism. However, these approaches suffer from limited efficiency from two aspects: low quality of task-relatedness quantification and inefficacy of exploiting the collaboration structure. To address these issues, we propose FedGKD, a novel federated GNN framework that utilizes a novel client-side graph dataset distillation method to extract task features that better describe task-relatedness, and introduces a novel server-side aggregation mechanism that is aware of the global collaboration structure. We conduct extensive experiments on six real-world datasets of different scales, demonstrating our framework's outperformance.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 40 of its 55 references that are in the map. First posted on arXiv 18 Sep 2023.
Builds on
40 of 55 references.
References · 40
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2020Rethinking Attention with Performerscited by 1,601
28 more
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2017Federated Multi-Task Learningcited by 672
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
- 2019Federated Learning with Personalization Layerscited by 541
- 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
- 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 213
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 194
- 2020Is Local SGD Better than Minibatch SGD?cited by 151
- 2021Graph Condensation for Graph Neural Networkscited by 150
- 2021Subgraph Federated Learning with Missing Neighbor Generationcited by 132
- 2022Privacy for Free: How does Dataset Condensation Help Privacy?cited by 120
- 2021Federated Graph Classification over Non-IID Graphscited by 114
- 2022Federated Learning with Partial Model Personalizationcited by 114
- 2021Multi-Center Federated Learning: Clients Clustering for Better Personalizationcited by 113
- 2020Distilled One-Shot Federated Learningcited by 109
- 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 97
- 2023Personalized Federated Learning with Feature Alignment and Classifier Collaborationcited by 97
- 2022Federated Learning on Non-IID Graphs via Structural Knowledge Sharingcited by 88
- 2022Personalized Subgraph Federated Learningcited by 54
- 2022Adaptive and Robust Multi-Task Learningcited by 34
- 2022Personalized Federated Learning With Graphcited by 29
- 2020A No-Free-Lunch Theorem for MultiTask Learningcited by 28
- 2021Learn Locally, Correct Globally: A Distributed Algorithm for Training Graph Neural Networkscited by 24
- 2023Optimizing the Collaboration Structure in Cross-Silo Federated Learningcited by 19
- 2021Minimax Estimation for Personalized Federated Learning: An Alternative between FedAvg and Local Training?cited by 15
Built on by
Citing papers per year: 2024: 6; 2025: 1.
7 papers.
- 2024A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensationcited by 57
- 2024Graph Condensation: A Surveycited by 23
- 2024GC-Bench: An Open and Unified Benchmark for Graph Condensationcited by 12
- 2024GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insightscited by 7
- 2024GCondenser: Benchmarking Graph Condensationcited by 5
- 2025Sharp Gaussian approximations for Decentralized Federated Learningcited by 1
- 2024TCGU: Data-centric Graph Unlearning based on Transferable Condensationcited by 0
- 2025Sharp Gaussian approximations for Decentralized Federated Learning12 May 2025
- 2024TCGU: Data-centric Graph Unlearning based on Transferable Condensation9 Oct 2024
- 2024GC-Bench: An Open and Unified Benchmark for Graph Condensation30 Jun 2024
- 2024GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights24 Jun 2024
- 2024GCondenser: Benchmarking Graph Condensation23 May 2024
- 2024A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation29 Jan 2024
- 2024Graph Condensation: A Survey22 Jan 2024