Context-Aware Online Client Selection for Hierarchical Federated Learning

计算机科学 服务器 选择(遗传算法) 背景(考古学) 甲骨文公司 架空(工程) 后悔 机器学习 人工智能 计算机网络 生物 操作系统 软件工程 古生物学
作者
Zhe Qu,Rui Duan,Lixing Chen,Jie Xu,Zhuo Lu,Yao Liu
出处
期刊:IEEE Transactions on Parallel and Distributed Systems [Institute of Electrical and Electronics Engineers]
卷期号:33 (12): 4353-4367 被引量:7
标识
DOI:10.1109/tpds.2022.3186960
摘要

Federated Learning (FL) has been considered as an appealing framework to tackle data privacy issues of mobile devices compared to conventional Machine Learning (ML). Using Edge Servers (ESs) as intermediaries to perform model aggregation in proximity can reduce the transmission overhead, and it enables great potential in low-latency FL, where the hierarchical architecture of FL (HFL) has been attracted more attention. Designing a proper client selection policy can significantly improve training performance, and it has been widely investigated in conventional FL studies. However, to the best of our knowledge, systematic client selection policies have not yet been fully studied for HFL. In addition, client selection for HFL faces more challenges than conventional FL (e.g., the time-varying connection of client-ES pairs and the limited budget of the Network Operator (NO)). In this article, we investigate a client selection problem for HFL, where the NO learns the number of successful participating clients to improve training performance (i.e., select as many clients in each round) as well as under the limited budget on each ES. An online policy, called Context-aware Online Client Selection (COCS), is developed based on Contextual Combinatorial Multi-Armed Bandit (CC-MAB). COCS observes the side-information (context) of local computing and transmission of client-ES pairs and makes client selection decisions to maximize NO's utility given a limited budget. Theoretically, COCS achieves a sublinear regret compared to an Oracle policy on both strongly convex and non-convex HFL. Simulation results also support the efficiency of the proposed COCS policy on real-world datasets.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
2秒前
Shawn完成签到,获得积分10
2秒前
yoyo关注了科研通微信公众号
2秒前
3秒前
GU发布了新的文献求助10
3秒前
3秒前
3秒前
牧楊人发布了新的文献求助10
4秒前
Shawn发布了新的文献求助10
5秒前
动听心锁完成签到 ,获得积分10
5秒前
sdnihbhew发布了新的文献求助10
5秒前
猪小猪发布了新的文献求助10
6秒前
廉乐儿发布了新的文献求助10
7秒前
zzz4743应助gaoshen采纳,获得30
7秒前
pb完成签到,获得积分10
8秒前
团团应助书篆采纳,获得10
10秒前
10秒前
Orange应助尤鹤采纳,获得20
12秒前
标致的傲之完成签到,获得积分10
12秒前
研友_ZA7B7L发布了新的文献求助10
12秒前
Jack完成签到,获得积分10
12秒前
13秒前
hihih完成签到,获得积分10
13秒前
here完成签到 ,获得积分10
13秒前
15秒前
义气的雨旋完成签到,获得积分10
15秒前
六日完成签到,获得积分10
15秒前
15秒前
乐观期待完成签到,获得积分10
17秒前
18秒前
yoyo发布了新的文献求助50
19秒前
19秒前
jogrgr发布了新的文献求助30
20秒前
凯里欧文发布了新的文献求助20
21秒前
然然发布了新的文献求助10
21秒前
知识学爆发布了新的文献求助10
21秒前
21秒前
六日发布了新的文献求助10
22秒前
酷波er应助清爽的奄采纳,获得10
22秒前
高分求助中
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Illustrated History of Gymnastics 800
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
Herman Melville: A Biography (Volume 1, 1819-1851) 600
Locomotion in marine mesosuchians (Crocodylia): the contribution of the "locomotion profiles" 500
Division and square root. Digit-recurrence algorithms and implementations 500
Hemerologies of Assyrian and Babylonian Scholars 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2498546
求助须知:如何正确求助?哪些是违规求助? 2154285
关于积分的说明 5509181
捐赠科研通 1875113
什么是DOI,文献DOI怎么找? 932477
版权声明 563722
科研通“疑难数据库(出版商)”最低求助积分说明 498358