Asynchronous Online Federated Learning with Reduced Communication Requirements
Not on the map. Why?
Abstract (arXiv)
Online federated learning (FL) enables geographically distributed devices to learn a global shared model from locally available streaming data. Most online FL literature considers a best-case scenario regarding the participating clients and the communication channels. However, these assumptions are often not met in real-world applications. Asynchronous settings can reflect a more realistic environment, such as heterogeneous client participation due to available computational power and battery constraints, as well as delays caused by communication channels or straggler devices. Further, in most applications, energy efficiency must be taken into consideration. Using the principles of partial-sharing-based communications, we propose a communication-efficient asynchronous online federated learning (PAO-Fed) strategy. By reducing the communication overhead of the participants, the proposed method renders participation in the learning task more accessible and efficient. In addition, the proposed aggregation mechanism accounts for random participation, handles delayed updates and mitigates their effect on accuracy. We prove the first and second-order convergence of the proposed PAO-Fed method and obtain an expression for its steady-state mean square deviation. Finally, we conduct comprehensive simulations to study the performance of the proposed method on both synthetic and real-life datasets. The simulations reveal that in asynchronous settings, the proposed PAO-Fed is able to achieve the same convergence properties as that of the online federated stochastic gradient while reducing the communication overhead by 98 percent.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 51 references that are in the map. First posted on arXiv 27 Mar 2023.
Builds on
24 of 51 references.
References · 24
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
- 2018Federated Learning with Non-IID Datacited by 1,108
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 419
- 2019Asynchronous Federated Optimizationcited by 267
- 2021Federated Learning with Buffered Asynchronous Aggregationcited by 190
- 2019Energy Efficient Federated Learning Over Wireless Communication Networkscited by 181
- 2019Communication-Efficient Federated Deep Learning with Asynchronous Model Update and Temporally Weighted Aggregationcited by 100
- 2020TiFL: A Tier-based Federated Learning Systemcited by 96
12 more
- 2019SAFA: a Semi-Asynchronous Protocol for Fast Federated Learning with Low Overheadcited by 82
- 2020Age of Information: An Introduction and Surveycited by 70
- 2021Federated Learning for Internet of Things: Applications, Challenges, and Opportunitiescited by 50
- 2019Age-Based Scheduling Policy for Federated Learning in Mobile Edge Networkscited by 39
- 2020FedADC: Accelerated Federated Learning with Drift Controlcited by 26
- 2020Edge Intelligence for Autonomous Driving in 6G Wireless System: Design Challenges and Solutionscited by 22
- 2022Scheduling and Aggregation Design for Asynchronous Federated Learning over Wireless Networkscited by 20
- 2021Communication-Efficient Online Federated Learning Framework for Nonlinear Regressioncited by 16
- 2021Asynchronous Federated Learning for Sensor Data with Concept Driftcited by 14
- 2021Device Scheduling and Update Aggregation Policies for Asynchronous Federated Learningcited by 7
- 2021Resource-Aware Asynchronous Online Federated Learning for Nonlinear Regressioncited by 5
- 2016Efficient KLMS and KRLS Algorithms: A Random Fourier Feature Perspectivecited by 2
Built on by
Citing papers per year: 2024: 2.
2 papers.