.png){kind=icon}
返回
Contribution-based Federated Learning client selection
.png){kind=icon}
OA
AI
DOI：10.1002/int.22879.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Federated Learning (FL), as a privacy-preserving machine learning paradigm, has been thrusted into the limelight. As a result of the physical bandwidth constraint, only a small number of clients are selected for each round of FL training. However, existing client selection solutions (e.g., the vanilla random selection) typically ignore the heterogeneous data value of the clients. In this paper, we propose the contribution-based selection algorithm (Contribution-Based Exponential-weight algorithm for Exploration and Exploitation, CBE3), which dynamically updates the selection weights according to the impact of clients' data. As a novel component of CBE3, a scaling factor, which helps maintain a good balance between global model accuracy and convergence speed, is proposed to improve the algorithm's adaptability. Theoretically, we proved the regret bound of the proposed CBE3 algorithm, which demonstrates performance gaps between the CBE3 and the optimal choice. Empirically, extensive experiments conducted on Non-Independent Identically Distributed data demonstrate the superior performance of CBE3-with up to 10% accuracy improvement compared with K-Center and Greedy and up to 100% faster convergence compared with the Random algorithm.
Keyword:
client
contribution-based
EXP3
Federated Learning
global models
Non-Independent Identically Distributed
期刊
IF:
3.7
论文数:
3.1K
被引数:
8.1K
机构
引用论文
.png){kind=icon}
Client Selection and Bandwidth Allocation in Wireless Federated Learning Networks: A Long-Term Perspective无线联合学习网络中的客户端选择和带宽分配: 长期观点OAAI
OAAI分享收藏Bringing Values Back In: The Adequacy of the European Social Survey to Measure Values in 20 Countries带回价值观: 欧洲社会调查衡量20个国家价值观的充分性OAAI
OAAI分享收藏
查看更多内容