UM  > Faculty of Science and Technology
Residential Collegefalse
Status已發表Published
GraphCS: Graph-based Client Selection for Heterogeneity in Federated Learning
Tao Chang1; Li Li2; Meihan Wu1; Xiaodong Wang1; ChengZhong Xu2; Wei Yu3
2023-03-21
Source PublicationJournal of Parallel and Distributed Computing
ISSN0743-7315
Volume177Pages:131-143
Abstract

Federated Learning coordinates many mobile devices to train an artificial intelligence model while preserving data privacy collaboratively. Mobile devices are usually equipped with totally different hardware configurations, leading to various training capabilities. At the same time, the distribution of the local training data is highly heterogeneous across different clients. Randomly selecting the clients to participate in the training process results in poor model performance and low system efficiency.

In this paper, we propose GraphCS, a graph-based client selection framework for heterogeneity in Federated Learning. GraphCS first measures the distribution coupling across the clients via the model gradients. After that, it divides the clients into different groups according to the diversity of the local datasets. At the same time, it well estimates the runtime training capability of each client by jointly considering the hardware configuration and resource contention caused by the concurrently running apps. With the distribution coupling information and runtime training capability, GraphCS selects the best clients in order to well balance the model accuracy and overall training progress. We evaluate the performance of GraphCS with mobile devices with different hardware configurations on various datasets. The experiment results show that our approach improves model accuracy up to 45.69%. Meanwhile, it reduces communication and computation overhead 87.35% and 89.48% at best, respectively. Furthermore, GraphCS accelerates the overall training process up to 35×.

KeywordFederated Learning Client Selection Heterogeneity
DOI10.1016/j.jpdc.2023.03.003
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaComputer Science
WOS SubjectComputer Science, Theory & Methods
WOS IDWOS:000970250900001
PublisherACADEMIC PRESS INC ELSEVIER SCIENCE, 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495
Scopus ID2-s2.0-85150897020
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionFaculty of Science and Technology
THE STATE KEY LABORATORY OF INTERNET OF THINGS FOR SMART CITY (UNIVERSITY OF MACAU)
Corresponding AuthorLi Li
Affiliation1.Key Laboratory of Parallel and Distributed Computing, College of Computer, National University of Defense Technology, China
2.State Key Laboratory of Internet of Things for Smart City, University of Macau, China
3.The 30th Research Institute of China Electronics Technology Group Corporation, China
Corresponding Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Tao Chang,Li Li,Meihan Wu,et al. GraphCS: Graph-based Client Selection for Heterogeneity in Federated Learning[J]. Journal of Parallel and Distributed Computing, 2023, 177, 131-143.
APA Tao Chang., Li Li., Meihan Wu., Xiaodong Wang., ChengZhong Xu., & Wei Yu (2023). GraphCS: Graph-based Client Selection for Heterogeneity in Federated Learning. Journal of Parallel and Distributed Computing, 177, 131-143.
MLA Tao Chang,et al."GraphCS: Graph-based Client Selection for Heterogeneity in Federated Learning".Journal of Parallel and Distributed Computing 177(2023):131-143.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Tao Chang]'s Articles
[Li Li]'s Articles
[Meihan Wu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Tao Chang]'s Articles
[Li Li]'s Articles
[Meihan Wu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Tao Chang]'s Articles
[Li Li]'s Articles
[Meihan Wu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.