Reinforcement Learning for Real-Time Federated Learning for Resource-Constrained Edge Cluster

IF 4.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Kolichala Rajashekar, Souradyuti Paul, Sushanta Karmakar, Subhajit Sidhanta
{"title":"Reinforcement Learning for Real-Time Federated Learning for Resource-Constrained Edge Cluster","authors":"Kolichala Rajashekar, Souradyuti Paul, Sushanta Karmakar, Subhajit Sidhanta","doi":"10.1007/s10922-024-09857-1","DOIUrl":null,"url":null,"abstract":"<p>For performing various predictive analytics tasks for real-time mission-critical applications, Federated Learning (FL) have emerged as the go-to machine learning paradigm for its ability to leverage perform machine learning workloads on resource-constrained edge devices. For such FL applications working under stringent deadlines, the overall <i>local training time</i> needs to be minimized, which consists of the <i>retrieval delay</i>, i.e., the delay in fetching the data from the IoT devices to the FL clients as well as the time consumed in training the local models. Since the latter component is mostly uniform among the FL clients, we have to minimize the retrieval delay to reduce the local training time. To that end, we formulate the Client Assignment Problem (CAP) as an intelligent assignment of selected IoT devices to each FL client such that the FL client may retrieve training data from these IoT devices with minimal retrieval delay. CAP must perform assignments for each FL client considering its relative distances from each IoT device such that each FL client does not experience an arbitrarily large retrieval delay in fetching data from a remotely placed IoT device. We prove that CAP is NP-Hard, and as such, obtaining a polynomial time solution to CAP is infeasible. To deal with the challenges faced by such heuristics approaches, we propose Deep Reinforcement Learning-based algorithms to produce near-optimal solution to CAP. We demonstrate that our algorithms outperform the state of the art in reducing the local training time, while producing a near-optimal solution.</p>","PeriodicalId":50119,"journal":{"name":"Journal of Network and Systems Management","volume":"1 1","pages":""},"PeriodicalIF":4.1000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Systems Management","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10922-024-09857-1","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

For performing various predictive analytics tasks for real-time mission-critical applications, Federated Learning (FL) have emerged as the go-to machine learning paradigm for its ability to leverage perform machine learning workloads on resource-constrained edge devices. For such FL applications working under stringent deadlines, the overall local training time needs to be minimized, which consists of the retrieval delay, i.e., the delay in fetching the data from the IoT devices to the FL clients as well as the time consumed in training the local models. Since the latter component is mostly uniform among the FL clients, we have to minimize the retrieval delay to reduce the local training time. To that end, we formulate the Client Assignment Problem (CAP) as an intelligent assignment of selected IoT devices to each FL client such that the FL client may retrieve training data from these IoT devices with minimal retrieval delay. CAP must perform assignments for each FL client considering its relative distances from each IoT device such that each FL client does not experience an arbitrarily large retrieval delay in fetching data from a remotely placed IoT device. We prove that CAP is NP-Hard, and as such, obtaining a polynomial time solution to CAP is infeasible. To deal with the challenges faced by such heuristics approaches, we propose Deep Reinforcement Learning-based algorithms to produce near-optimal solution to CAP. We demonstrate that our algorithms outperform the state of the art in reducing the local training time, while producing a near-optimal solution.

Abstract Image

为资源受限的边缘集群进行实时联合学习的强化学习
为了在实时关键任务应用中执行各种预测分析任务,联邦学习(Federated Learning,FL)因其能够在资源有限的边缘设备上利用执行机器学习工作负载的能力而成为机器学习的首选范例。对于此类在严格期限内工作的 FL 应用程序,需要最大限度地减少整体本地训练时间,其中包括检索延迟(即从物联网设备向 FL 客户端获取数据的延迟)以及训练本地模型所消耗的时间。由于后一部分在 FL 客户端之间大多是一致的,因此我们必须尽量减少检索延迟,以缩短本地训练时间。为此,我们将客户分配问题(CAP)表述为将选定的物联网设备智能分配给每个 FL 客户端,以便 FL 客户端能以最小的检索延迟从这些物联网设备中检索训练数据。CAP 必须考虑每个 FL 客户端与每个物联网设备的相对距离,为每个 FL 客户端执行分配,使每个 FL 客户端在从远程放置的物联网设备获取数据时不会出现任意大的检索延迟。我们证明 CAP 是 NP-Hard,因此,获得 CAP 的多项式时间解决方案是不可行的。为了应对此类启发式方法所面临的挑战,我们提出了基于深度强化学习的算法,以产生接近最优的 CAP 解决方案。我们证明,我们的算法在减少局部训练时间方面优于现有技术,同时还能生成近乎最优的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
65
审稿时长
>12 weeks
期刊介绍: Journal of Network and Systems Management, features peer-reviewed original research, as well as case studies in the fields of network and system management. The journal regularly disseminates significant new information on both the telecommunications and computing aspects of these fields, as well as their evolution and emerging integration. This outstanding quarterly covers architecture, analysis, design, software, standards, and migration issues related to the operation, management, and control of distributed systems and communication networks for voice, data, video, and networked computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信