Efficient Asynchronous Federated Learning with Sparsification and Quantization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Jia, Juncheng, Liu, Ji, Zhou, Chendi, Tian, Hao, Dong, Mianxiong, Dou, Dejing
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914631584317440
author Jia, Juncheng
Liu, Ji
Zhou, Chendi
Tian, Hao
Dong, Mianxiong
Dou, Dejing
author_facet Jia, Juncheng
Liu, Ji
Zhou, Chendi
Tian, Hao
Dong, Mianxiong
Dou, Dejing
contents While data is distributed in multiple edge devices, Federated Learning (FL) is attracting more and more attention to collaboratively train a machine learning model without transferring raw data. FL generally exploits a parameter server and a large number of edge devices during the whole process of the model training, while several devices are selected in each round. However, straggler devices may slow down the training process or even make the system crash during training. Meanwhile, other idle edge devices remain unused. As the bandwidth between the devices and the server is relatively low, the communication of intermediate data becomes a bottleneck. In this paper, we propose Time-Efficient Asynchronous federated learning with Sparsification and Quantization, i.e., TEASQ-Fed. TEASQ-Fed can fully exploit edge devices to asynchronously participate in the training process by actively applying for tasks. We utilize control parameters to choose an appropriate number of parallel edge devices, which simultaneously execute the training tasks. In addition, we introduce a caching mechanism and weighted averaging with respect to model staleness to further improve the accuracy. Furthermore, we propose a sparsification and quantitation approach to compress the intermediate data to accelerate the training. The experimental results reveal that TEASQ-Fed improves the accuracy (up to 16.67% higher) while accelerating the convergence of model training (up to twice faster).
format Preprint
id arxiv_https___arxiv_org_abs_2312_15186
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Efficient Asynchronous Federated Learning with Sparsification and Quantization
Jia, Juncheng
Liu, Ji
Zhou, Chendi
Tian, Hao
Dong, Mianxiong
Dou, Dejing
Distributed, Parallel, and Cluster Computing
Artificial Intelligence
Machine Learning
While data is distributed in multiple edge devices, Federated Learning (FL) is attracting more and more attention to collaboratively train a machine learning model without transferring raw data. FL generally exploits a parameter server and a large number of edge devices during the whole process of the model training, while several devices are selected in each round. However, straggler devices may slow down the training process or even make the system crash during training. Meanwhile, other idle edge devices remain unused. As the bandwidth between the devices and the server is relatively low, the communication of intermediate data becomes a bottleneck. In this paper, we propose Time-Efficient Asynchronous federated learning with Sparsification and Quantization, i.e., TEASQ-Fed. TEASQ-Fed can fully exploit edge devices to asynchronously participate in the training process by actively applying for tasks. We utilize control parameters to choose an appropriate number of parallel edge devices, which simultaneously execute the training tasks. In addition, we introduce a caching mechanism and weighted averaging with respect to model staleness to further improve the accuracy. Furthermore, we propose a sparsification and quantitation approach to compress the intermediate data to accelerate the training. The experimental results reveal that TEASQ-Fed improves the accuracy (up to 16.67% higher) while accelerating the convergence of model training (up to twice faster).
title Efficient Asynchronous Federated Learning with Sparsification and Quantization
topic Distributed, Parallel, and Cluster Computing
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2312.15186