Federated Graph Learning with Adaptive Importance-based Sampling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914954781655040 |
|---|---|
| author | Li, Anran Chen, Yuanyuan Ren, Chao Wang, Wenhan Hu, Ming Li, Tianlin Yu, Han Chen, Qingyu |
| author_facet | Li, Anran Chen, Yuanyuan Ren, Chao Wang, Wenhan Hu, Ming Li, Tianlin Yu, Han Chen, Qingyu |
| contents | For privacy-preserving graph learning tasks involving distributed graph datasets, federated learning (FL)-based GCN (FedGCN) training is required. A key challenge for FedGCN is scaling to large-scale graphs, which typically incurs high computation and communication costs when dealing with the explosively increasing number of neighbors. Existing graph sampling-enhanced FedGCN training approaches ignore graph structural information or dynamics of optimization, resulting in high variance and inaccurate node embeddings. To address this limitation, we propose the Federated Adaptive Importance-based Sampling (FedAIS) approach. It achieves substantial computational cost saving by focusing the limited resources on training important nodes, while reducing communication overhead via adaptive historical embedding synchronization. The proposed adaptive importance-based sampling method jointly considers the graph structural heterogeneity and the optimization dynamics to achieve optimal trade-off between efficiency and accuracy. Extensive evaluations against five state-of-the-art baselines on five real-world graph datasets show that FedAIS achieves comparable or up to 3.23% higher test accuracy, while saving communication and computation costs by 91.77% and 85.59%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_14655 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Federated Graph Learning with Adaptive Importance-based Sampling Li, Anran Chen, Yuanyuan Ren, Chao Wang, Wenhan Hu, Ming Li, Tianlin Yu, Han Chen, Qingyu Distributed, Parallel, and Cluster Computing Cryptography and Security Machine Learning For privacy-preserving graph learning tasks involving distributed graph datasets, federated learning (FL)-based GCN (FedGCN) training is required. A key challenge for FedGCN is scaling to large-scale graphs, which typically incurs high computation and communication costs when dealing with the explosively increasing number of neighbors. Existing graph sampling-enhanced FedGCN training approaches ignore graph structural information or dynamics of optimization, resulting in high variance and inaccurate node embeddings. To address this limitation, we propose the Federated Adaptive Importance-based Sampling (FedAIS) approach. It achieves substantial computational cost saving by focusing the limited resources on training important nodes, while reducing communication overhead via adaptive historical embedding synchronization. The proposed adaptive importance-based sampling method jointly considers the graph structural heterogeneity and the optimization dynamics to achieve optimal trade-off between efficiency and accuracy. Extensive evaluations against five state-of-the-art baselines on five real-world graph datasets show that FedAIS achieves comparable or up to 3.23% higher test accuracy, while saving communication and computation costs by 91.77% and 85.59%. |
| title | Federated Graph Learning with Adaptive Importance-based Sampling |
| topic | Distributed, Parallel, and Cluster Computing Cryptography and Security Machine Learning |
| url | https://arxiv.org/abs/2409.14655 |