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

Decentralized Edge Intelligence: A Dynamic Resource Allocation Framework for Hierarchical Federated Learning

计算机科学 服务器 分布式计算 瓶颈 激励 资源配置 原始数据 GSM演进的增强数据速率 云计算 边缘设备 计算机网络 人工智能 操作系统 嵌入式系统 经济 微观经济学 程序设计语言
作者
Wei Yang Bryan Lim,Jer Shyuan Ng,Zehui Xiong,Jiangming Jin,Yang Zhang,Dusit Niyato,Cyril Leung,Chunyan Miao
出处
期刊:IEEE Transactions on Parallel and Distributed Systems [Institute of Electrical and Electronics Engineers]
卷期号:33 (3): 536-550 被引量:193
标识
DOI:10.1109/tpds.2021.3096076
摘要

To enable the large scale and efficient deployment of Artificial Intelligence (AI), the confluence of AI and Edge Computing has given rise to Edge Intelligence, which leverages on the computation and communication capabilities of end devices and edge servers to process data closer to where it is produced. One of the enabling technologies of Edge Intelligence is the privacy preserving machine learning paradigm known as Federated Learning (FL), which enables data owners to conduct model training without having to transmit their raw data to third-party servers. However, the FL network is envisioned to involve thousands of heterogeneous distributed devices. As a result, communication inefficiency remains a key bottleneck. To reduce node failures and device dropouts, the Hierarchical Federated Learning (HFL) framework has been proposed whereby cluster heads are designated to support the data owners through intermediate model aggregation. This decentralized learning approach reduces the reliance on a central controller, e.g., the model owner. However, the issues of resource allocation and incentive design are not well-studied in the HFL framework. In this article, we consider a two-level resource allocation and incentive mechanism design problem. In the lower level, the cluster heads offer rewards in exchange for the data owners' participation, and the data owners are free to choose which cluster to join. Specifically, we apply the evolutionary game theory to model the dynamics of the cluster selection process. In the upper level, each cluster head can choose to serve a model owner, whereas the model owners have to compete amongst each other for the services of the cluster heads. As such, we propose a deep learning based auction mechanism to derive the valuation of each cluster head's services. The performance evaluation shows the uniqueness and stability of our proposed evolutionary game, as well as the revenue maximizing properties of the deep learning based auction.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
今后应助科研通管家采纳,获得10
33秒前
科研通AI2S应助david采纳,获得10
54秒前
帅气惜霜完成签到 ,获得积分10
57秒前
xiaolang2004完成签到,获得积分10
58秒前
1分钟前
jiaobu发布了新的文献求助10
1分钟前
annnnnnd完成签到 ,获得积分10
1分钟前
赘婿应助jiaobu采纳,获得10
1分钟前
eccentric完成签到,获得积分10
1分钟前
科研通AI2S应助科研通管家采纳,获得10
2分钟前
2分钟前
3分钟前
科研通AI5应助Tia采纳,获得10
3分钟前
3分钟前
性静H情逸发布了新的文献求助10
3分钟前
性静H情逸完成签到,获得积分10
4分钟前
wbs13521完成签到,获得积分10
4分钟前
4分钟前
5分钟前
5分钟前
baobeikk完成签到 ,获得积分10
5分钟前
双手外科结完成签到,获得积分10
6分钟前
6分钟前
6分钟前
6分钟前
7分钟前
7分钟前
所所应助积极的凝海采纳,获得10
7分钟前
NaCl完成签到 ,获得积分10
8分钟前
开心每一天完成签到 ,获得积分10
8分钟前
8分钟前
英俊的铭应助科研通管家采纳,获得10
8分钟前
于东完成签到,获得积分10
8分钟前
8分钟前
星辰大海应助于东采纳,获得10
8分钟前
jiaobu发布了新的文献求助10
8分钟前
学术骗子小刚完成签到,获得积分0
8分钟前
9分钟前
balko完成签到,获得积分10
9分钟前
华仔应助jiaobu采纳,获得10
9分钟前
高分求助中
Les Mantodea de Guyane Insecta, Polyneoptera 2500
Mobilization, center-periphery structures and nation-building 600
Technologies supporting mass customization of apparel: A pilot project 520
Introduction to Strong Mixing Conditions Volumes 1-3 500
Fine Chemicals through Heterogeneous Catalysis 430
China—Art—Modernity: A Critical Introduction to Chinese Visual Expression from the Beginning of the Twentieth Century to the Present Day 430
Multichannel rotary joints-How they work 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3795590
求助须知:如何正确求助?哪些是违规求助? 3340629
关于积分的说明 10300837
捐赠科研通 3057157
什么是DOI,文献DOI怎么找? 1677522
邀请新用户注册赠送积分活动 805442
科研通“疑难数据库(出版商)”最低求助积分说明 762563