Title
Resource-Efficient Federated Learning with Hierarchical Aggregation in Edge Computing
Abstract
Federated learning (FL) has emerged in edge computing to address limited bandwidth and privacy concerns of traditional cloud-based centralized training. However, the existing FL mechanisms may lead to long training time and consume a tremendous amount of communication resources. In this paper, we propose an efficient FL mechanism, which divides the edge nodes into K clusters by balanced clustering. The edge nodes in one cluster forward their local updates to cluster header for aggregation by synchronous method, called cluster aggregation, while all cluster headers perform the asynchronous method for global aggregation. This processing procedure is called hierarchical aggregation. Our analysis shows that the convergence bound depends on the number of clusters and the training epochs. We formally define the resource-efficient federated learning with hierarchical aggregation (RFL-HA) problem. We propose an efficient algorithm to determine the optimal cluster structure (i.e., the optimal value of K) with resource constraints and extend it to deal with the dynamic network conditions. Extensive simulation results obtained from our study for different models and datasets show that the proposed algorithms can reduce completion time by 34.8%-70% and the communication resource by 33.8%-56.5% while achieving a similar accuracy, compared with the well-known FL mechanisms.
Year
DOI
Venue
2021
10.1109/INFOCOM42981.2021.9488756
IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
Keywords
DocType
ISSN
Federated Learning,Mobile Edge Computing,Resource-constraint,Cluster,Optimization
Conference
0743-166X
ISBN
Citations 
PageRank 
978-1-6654-3131-6
3
0.40
References 
Authors
12
6
Name
Order
Citations
PageRank
Zhiyuan Wang131.41
Hongli Xu250285.92
Jianchun Liu382.83
He Huang482965.14
Chunming Qiao53971400.49
Yangming Zhao630.40