亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Energy or Accuracy? Near-Optimal User Selection and Aggregator Placement for Federated Learning in MEC

计算机科学 上传 新闻聚合器 后悔 能源消耗 机器学习 能量(信号处理) 人工智能 选择算法 近似算法 选择(遗传算法) 算法 统计 操作系统 生物 数学 生态学
作者
Zichuan Xu,Dongrui Li,Weifa Liang,Wenzheng Xu,Qiufen Xia,Pan Zhou,Omer Rana,Hao Li
出处
期刊:IEEE Transactions on Mobile Computing [IEEE Computer Society]
卷期号:23 (3): 2470-2485 被引量:7
标识
DOI:10.1109/tmc.2023.3262829
摘要

To unveil the hidden value in the datasets of user equipments (UEs) while preserving user privacy, federated learning (FL) is emerging as a promising technique to train a machine learning model using the datasets of UEs locally without uploading the datasets to a central location. Customers require to train machine learning models based on different datasets of UEs, through issuing FL requests that are implemented by FL services in a mobile edge computing (MEC) network. A key challenge of enabling FL in MEC networks is how to minimize the energy consumption of implementing FL requests while guaranteeing the accuracy of machine learning models, given that the availabilities of UEs usually are uncertain. In this paper, we investigate the problem of energy minimization for FL in an MEC network with uncertain availabilities of UEs. We first consider the energy minimization problem for a single FL request in an MEC network. We then propose a novel optimization framework for the problem with a single FL request, which consists of (1) an online learning algorithm with a bounded regret for the UE selection, by considering various contexts (side information) that influence energy consumption; and (2) an approximation algorithm with an approximation ratio for the aggregator placement for a single FL request. We thirdly deal with the problem with multiple FL requests, for which we devise an online learning algorithm with a bounded regret. We finally evaluate the performance of the proposed algorithms by extensive experiments. Experimental results show that the proposed algorithms outperform their counterparts by reducing at least 13% of the total energy consumption while achieving the same accuracy.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Jasper应助愤怒的梦曼采纳,获得10
6秒前
caca完成签到,获得积分0
43秒前
54秒前
平常安发布了新的文献求助10
59秒前
1分钟前
aaa发布了新的文献求助10
1分钟前
aaa完成签到,获得积分20
1分钟前
波恩奥本海默绝热近似完成签到,获得积分10
1分钟前
1分钟前
2分钟前
2分钟前
楠lalala发布了新的文献求助10
2分钟前
李健应助迷路竹采纳,获得10
2分钟前
坤坤完成签到,获得积分10
2分钟前
2分钟前
xcgh应助ylsk采纳,获得10
2分钟前
脑洞疼应助楠lalala采纳,获得10
2分钟前
冰雪痕发布了新的文献求助10
2分钟前
snowwww发布了新的文献求助20
2分钟前
3分钟前
平常安发布了新的文献求助10
3分钟前
大模型应助科研通管家采纳,获得10
3分钟前
领导范儿应助科研通管家采纳,获得10
3分钟前
GPTea应助科研通管家采纳,获得20
3分钟前
田様应助科研通管家采纳,获得10
3分钟前
万能图书馆应助冰雪痕采纳,获得10
4分钟前
4分钟前
冰雪痕发布了新的文献求助10
4分钟前
小二郎应助慢走不宋女士采纳,获得10
4分钟前
酷波er应助Elysa采纳,获得10
4分钟前
4分钟前
冷静的梦芝完成签到 ,获得积分10
5分钟前
99668完成签到,获得积分10
5分钟前
共享精神应助科研通管家采纳,获得10
5分钟前
6分钟前
6分钟前
6分钟前
田様应助秋日思语采纳,获得10
6分钟前
anders完成签到 ,获得积分10
6分钟前
7分钟前
高分求助中
Pipeline and riser loss of containment 2001 - 2020 (PARLOC 2020) 1000
哈工大泛函分析教案课件、“72小时速成泛函分析:从入门到入土.PDF”等 660
Comparing natural with chemical additive production 500
The Leucovorin Guide for Parents: Understanding Autism’s Folate 500
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 500
A Manual for the Identification of Plant Seeds and Fruits : Second revised edition 500
The Social Work Ethics Casebook: Cases and Commentary (revised 2nd ed.) 400
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 5210497
求助须知:如何正确求助?哪些是违规求助? 4387298
关于积分的说明 13662653
捐赠科研通 4247146
什么是DOI,文献DOI怎么找? 2330125
邀请新用户注册赠送积分活动 1327877
关于科研通互助平台的介绍 1280484