TY - JOUR
T1 - AutoFL
T2 - a Bayesian game approach for autonomous client participation in federated edge learning
AU - Hu, Miao
AU - Yang, Wenzhuo
AU - Luo, Zhenxiao
AU - Liu, Xuezheng
AU - Zhou, Yipeng
AU - Chen, Xu
AU - Wu, Di
PY - 2024/1
Y1 - 2024/1
N2 - Given that devices (i.e., clients) participating in federated edge learning (FEL) are autonomous and resource-constrained in nature, it is critical to design effective incentive mechanisms to encourage client participation so as to improve the performance of FEL. In this article, we aim to boost the FEL training efficiency by answering how much compute resource should clients autonomously contribute to maximize their utilities. To this end, we develop AutoFL, an autonomous client participation decision framework for federated learning at the network edge without assuming that each client possesses complete information. We first model the problem of autonomous client participation as a Bayesian game with incomplete information, where each player in the game is associated with a set of types according to network conditions. We optimize an individual client's decision based on the dynamics of the population estimated following the Bayes rule. We prove that AutoFL can converge to a unique Bayesian Nash equilibrium point. Empirical results on three real datasets show that AutoFL achieves a higher model accuracy with only 15.5-24.5% model aggregation time per global training round, and its energy cost saving on mobile devices is 82.2-86.8% compared to the state-of-the-art algorithms. Moreover, we can achieve a 2.75-3.2x long-term fairness compared to classical solutions.
AB - Given that devices (i.e., clients) participating in federated edge learning (FEL) are autonomous and resource-constrained in nature, it is critical to design effective incentive mechanisms to encourage client participation so as to improve the performance of FEL. In this article, we aim to boost the FEL training efficiency by answering how much compute resource should clients autonomously contribute to maximize their utilities. To this end, we develop AutoFL, an autonomous client participation decision framework for federated learning at the network edge without assuming that each client possesses complete information. We first model the problem of autonomous client participation as a Bayesian game with incomplete information, where each player in the game is associated with a set of types according to network conditions. We optimize an individual client's decision based on the dynamics of the population estimated following the Bayes rule. We prove that AutoFL can converge to a unique Bayesian Nash equilibrium point. Empirical results on three real datasets show that AutoFL achieves a higher model accuracy with only 15.5-24.5% model aggregation time per global training round, and its energy cost saving on mobile devices is 82.2-86.8% compared to the state-of-the-art algorithms. Moreover, we can achieve a 2.75-3.2x long-term fairness compared to classical solutions.
UR - http://www.scopus.com/inward/record.url?scp=85144752245&partnerID=8YFLogxK
U2 - 10.1109/TMC.2022.3227014
DO - 10.1109/TMC.2022.3227014
M3 - Article
AN - SCOPUS:85144752245
SN - 1536-1233
VL - 23
SP - 194
EP - 208
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 1
ER -