Client selection for federated learning using combinatorial multi-armed bandit under long-term energy constraint

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 250; p. 110512
• Main Authors: Zhu, Konglin, Zhang, Fuchun, Jiao, Lei, Xue, Bowei, Zhang, Lin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.08.2024
• Subjects: Client selection; Combinatorial multi-armed bandit; Federated learning; Lyapunov optimization; Lyapunov optimization; Federated learning; Client selection; Combinatorial multi-armed bandit
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2024.110512

In a federated learning system, it is often the case that the more clients it involves, the less increment of the outcome it achieves. It is thus essential to design a client selection strategy to choose an appropriate subset of the clients to participate in federated learning. However, client selection is not easy due to the heterogeneity of clients and the long-term energy budget of each client. Moreover, long-term energy budgets intertwined with the short-term client selection often make the problem NP-hard. In this paper, we propose an online strategy Energy-Aware Client Selection for Federated Learning (EACS-FL) to address this problem. The problem is formulated with a joint energy and delay optimization objective, and the Combinatorial Multi-Armed Bandit (CMAB) is introduced to solve the problem in an online manner. We take advantage of Lyapunov optimization to manage energy consumption of clients, which enables us to deal with independent energy budgets through minimizing virtual energy deficit queues. Theoretical analysis shows that EACS-FL achieves sublinear regret and keeps all queues stable. Experiment results exhibit that the proposed approach outperforms the existing works and achieves close-to-optimal delay and energy consumption performance.