A Resource-Adaptive Approach for Federated Learning under Resource-Constrained Environments

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhang, Ruirui, Wu, Xingze, Zou, Yifei, Xie, Zhenzhen, Li, Peng, Cheng, Xiuzhen, Yu, Dongxiao
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914841429540864
author Zhang, Ruirui
Wu, Xingze
Zou, Yifei
Xie, Zhenzhen
Li, Peng
Cheng, Xiuzhen
Yu, Dongxiao
author_facet Zhang, Ruirui
Wu, Xingze
Zou, Yifei
Xie, Zhenzhen
Li, Peng
Cheng, Xiuzhen
Yu, Dongxiao
contents The paper studies a fundamental federated learning (FL) problem involving multiple clients with heterogeneous constrained resources. Compared with the numerous training parameters, the computing and communication resources of clients are insufficient for fast local training and real-time knowledge sharing. Besides, training on clients with heterogeneous resources may result in the straggler problem. To address these issues, we propose Fed-RAA: a Resource-Adaptive Asynchronous Federated learning algorithm. Different from vanilla FL methods, where all parameters are trained by each participating client regardless of resource diversity, Fed-RAA adaptively allocates fragments of the global model to clients based on their computing and communication capabilities. Each client then individually trains its assigned model fragment and asynchronously uploads the updated result. Theoretical analysis confirms the convergence of our approach. Additionally, we design an online greedy-based algorithm for fragment allocation in Fed-RAA, achieving fairness comparable to an offline strategy. We present numerical results on MNIST, CIFAR-10, and CIFAR-100, along with necessary comparisons and ablation studies, demonstrating the advantages of our work. To the best of our knowledge, this paper represents the first resource-adaptive asynchronous method for fragment-based FL with guaranteed theoretical convergence.
format Preprint
id arxiv_https___arxiv_org_abs_2406_13351
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Resource-Adaptive Approach for Federated Learning under Resource-Constrained Environments
Zhang, Ruirui
Wu, Xingze
Zou, Yifei
Xie, Zhenzhen
Li, Peng
Cheng, Xiuzhen
Yu, Dongxiao
Machine Learning
Artificial Intelligence
Distributed, Parallel, and Cluster Computing
The paper studies a fundamental federated learning (FL) problem involving multiple clients with heterogeneous constrained resources. Compared with the numerous training parameters, the computing and communication resources of clients are insufficient for fast local training and real-time knowledge sharing. Besides, training on clients with heterogeneous resources may result in the straggler problem. To address these issues, we propose Fed-RAA: a Resource-Adaptive Asynchronous Federated learning algorithm. Different from vanilla FL methods, where all parameters are trained by each participating client regardless of resource diversity, Fed-RAA adaptively allocates fragments of the global model to clients based on their computing and communication capabilities. Each client then individually trains its assigned model fragment and asynchronously uploads the updated result. Theoretical analysis confirms the convergence of our approach. Additionally, we design an online greedy-based algorithm for fragment allocation in Fed-RAA, achieving fairness comparable to an offline strategy. We present numerical results on MNIST, CIFAR-10, and CIFAR-100, along with necessary comparisons and ablation studies, demonstrating the advantages of our work. To the best of our knowledge, this paper represents the first resource-adaptive asynchronous method for fragment-based FL with guaranteed theoretical convergence.
title A Resource-Adaptive Approach for Federated Learning under Resource-Constrained Environments
topic Machine Learning
Artificial Intelligence
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2406.13351