走向基于拍卖的边缘人工智能:在边缘网络中协调和激励在线迁移学习

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Yan Chen , Lei Jiao , Tuo Cao , Ji Qi , Gangyi Luo , Sheng Zhang , Sanglu Lu , Zhuzhong Qian
{"title":"走向基于拍卖的边缘人工智能:在边缘网络中协调和激励在线迁移学习","authors":"Yan Chen ,&nbsp;Lei Jiao ,&nbsp;Tuo Cao ,&nbsp;Ji Qi ,&nbsp;Gangyi Luo ,&nbsp;Sheng Zhang ,&nbsp;Sanglu Lu ,&nbsp;Zhuzhong Qian","doi":"10.1016/j.comnet.2025.111300","DOIUrl":null,"url":null,"abstract":"<div><div>The edge AI service can procure external pre-trained models to “strengthen” its local edge models by conducting online transfer learning from the former to the latter to serve inference requests continuously and resiliently. In this paper, we present a modeling and algorithmic study of designing an auction-based mechanism to realize this scenario, while overcoming unique challenges of the interdependency between consecutive auctions, the intertwinement between system overhead and models’ inference performance, and the need of preserving desired economic properties in each auction. We first formulate a long-term social cost minimization problem, which is unsurprisingly intractable. We then design a group of polynomial-time online approximation algorithms that decouple the interdependency, solve each relaxed auction individually, and round the fractional decisions into integers to procure and deploy pre-trained models. Our algorithms also control online transfer learning on each edge by adapting the weights associated to different models and updating the edge model itself through streaming data. We rigorously prove the competitive ratio of our approach, the upper bound on the number of the inference mistakes, and the truthfulness and the individual rationality of each auction. Via extensive evaluations, we have validated the superior performance of our approach over multiple alternative methods.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"265 ","pages":"Article 111300"},"PeriodicalIF":4.4000,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Toward auction-based edge AI: Orchestrating and incentivizing online transfer learning in edge networks\",\"authors\":\"Yan Chen ,&nbsp;Lei Jiao ,&nbsp;Tuo Cao ,&nbsp;Ji Qi ,&nbsp;Gangyi Luo ,&nbsp;Sheng Zhang ,&nbsp;Sanglu Lu ,&nbsp;Zhuzhong Qian\",\"doi\":\"10.1016/j.comnet.2025.111300\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The edge AI service can procure external pre-trained models to “strengthen” its local edge models by conducting online transfer learning from the former to the latter to serve inference requests continuously and resiliently. In this paper, we present a modeling and algorithmic study of designing an auction-based mechanism to realize this scenario, while overcoming unique challenges of the interdependency between consecutive auctions, the intertwinement between system overhead and models’ inference performance, and the need of preserving desired economic properties in each auction. We first formulate a long-term social cost minimization problem, which is unsurprisingly intractable. We then design a group of polynomial-time online approximation algorithms that decouple the interdependency, solve each relaxed auction individually, and round the fractional decisions into integers to procure and deploy pre-trained models. Our algorithms also control online transfer learning on each edge by adapting the weights associated to different models and updating the edge model itself through streaming data. We rigorously prove the competitive ratio of our approach, the upper bound on the number of the inference mistakes, and the truthfulness and the individual rationality of each auction. Via extensive evaluations, we have validated the superior performance of our approach over multiple alternative methods.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"265 \",\"pages\":\"Article 111300\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625002683\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625002683","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

边缘人工智能服务可以获取外部预训练模型,通过从前者到后者的在线迁移学习来“加强”其局部边缘模型,以连续和弹性地服务推理请求。在本文中,我们提出了一个建模和算法研究,设计一个基于拍卖的机制来实现这一场景,同时克服了连续拍卖之间的相互依赖,系统开销和模型推理性能之间的纠缠,以及在每次拍卖中保留期望的经济属性的需求。我们首先提出了一个长期的社会成本最小化问题,这个问题毫无疑问是棘手的。然后,我们设计了一组多项式时间在线近似算法,这些算法解耦了相互依赖性,单独求解每个放松拍卖,并将分数决策四舍五入为整数,以获取和部署预训练模型。我们的算法还通过调整与不同模型相关的权重并通过流数据更新边缘模型本身来控制每个边缘上的在线迁移学习。我们严格地证明了我们的方法的竞争率,推理错误数量的上界,以及每次拍卖的真实性和个人合理性。通过广泛的评估,我们已经验证了我们的方法优于多种替代方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Toward auction-based edge AI: Orchestrating and incentivizing online transfer learning in edge networks
The edge AI service can procure external pre-trained models to “strengthen” its local edge models by conducting online transfer learning from the former to the latter to serve inference requests continuously and resiliently. In this paper, we present a modeling and algorithmic study of designing an auction-based mechanism to realize this scenario, while overcoming unique challenges of the interdependency between consecutive auctions, the intertwinement between system overhead and models’ inference performance, and the need of preserving desired economic properties in each auction. We first formulate a long-term social cost minimization problem, which is unsurprisingly intractable. We then design a group of polynomial-time online approximation algorithms that decouple the interdependency, solve each relaxed auction individually, and round the fractional decisions into integers to procure and deploy pre-trained models. Our algorithms also control online transfer learning on each edge by adapting the weights associated to different models and updating the edge model itself through streaming data. We rigorously prove the competitive ratio of our approach, the upper bound on the number of the inference mistakes, and the truthfulness and the individual rationality of each auction. Via extensive evaluations, we have validated the superior performance of our approach over multiple alternative methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信