Yan Chen , Lei Jiao , Tuo Cao , Ji Qi , Gangyi Luo , Sheng Zhang , Sanglu Lu , Zhuzhong Qian
{"title":"走向基于拍卖的边缘人工智能:在边缘网络中协调和激励在线迁移学习","authors":"Yan Chen , Lei Jiao , Tuo Cao , Ji Qi , Gangyi Luo , Sheng Zhang , Sanglu Lu , 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 , Lei Jiao , Tuo Cao , Ji Qi , Gangyi Luo , Sheng Zhang , Sanglu Lu , 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}
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 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.