Resource Allocation for Time-triggered Federated Learning over Wireless Networks

Abstract

The newly emerging federated learning (FL) framework offers a new way to train machine learning models in a privacy-preserving manner. However, traditional FL algorithms are based on an event-triggered aggregation, which suffers from stragglers and communication overhead issues. To address these issues, in this paper, we present a time-triggered FL algorithm (TT-Fed) over wireless networks, which is a generalization of classic synchronous and asynchronous FL. Taking the resource-constrained and unreliable nature of wireless networks into account, we jointly consider the user selection and bandwidth optimization problem to minimize the FL training loss. The optimization problem is decomposed into tractable sub-problems with respect to each global aggregation round, and finally solved by our proposed greedy search algorithm. Simulation results show that compared to asynchronous FL (FedAsync) and FL with asynchronous tiers (FedAT) benchmarks, our proposed TT-Fed algorithm improves the converged test accuracy by up to 12.5% and 5%, respectively, under highly imbalanced and non-IID data, while substantially reducing the communication overhead.