Uplink Time Constrained Federated Learning over Wireless Networks
- Authors
- Choi, J.H.[Choi, Ji Ho]; Kim, D.I.[Kim, Dong In]
- Issue Date
- 2023
- Publisher
- IEEE Computer Society
- Keywords
- convergence time; fading channel; Federated learning (FL); straggler effect; uplink time constraint
- Citation
- International Conference on Ubiquitous and Future Networks, ICUFN, v.2023-July, pp.283 - 288
- Indexed
- SCOPUS
- Journal Title
- International Conference on Ubiquitous and Future Networks, ICUFN
- Volume
- 2023-July
- Start Page
- 283
- End Page
- 288
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/108217
- DOI
- 10.1109/ICUFN57995.2023.10201208
- ISSN
- 2165-8528
- Abstract
- Federated learning (FL) is an emerging distributed learning paradigm that collaboratively trains a shared model while preserving their data privacy. However, clients participating in the FL process have heterogeneous computation power and communication resources. Therefore, the central server needs to wait for the slowest client finishes uploading its local model update, which is known as straggler effect. In this paper, we propose a novel FL method with uplink time constraint set by the server to mitigate the straggler effect over wireless networks. First, we study the impact of uplink time constraint on the number of clients with successful upload in Rayleigh fading channel. Since acquiring perfect channel state information (CSI) is challenging in practical FL applications, the server exploits channel statistics instead. We then formulate an optimization problem for the error convergence speed with respect to uplink time constraint. Finally, we confirm that the proposed scheme, namely FL with Uplink Time Constraint (FedUTC), achieves faster convergence speed than the baseline FL method. © 2023 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > School of Electronic and Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.