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

被引:9
|
作者
Xu, Zichuan [1 ,2 ]
Li, Dongrui [1 ,2 ]
Liang, Weifa [3 ]
Xu, Wenzheng [4 ]
Xia, Qiufen [5 ]
Zhou, Pan [6 ]
Rana, Omer F. [7 ]
Li, Hao [8 ]
机构
[1] Dalian Univ Technol, Sch Software, Dalian 116024, Peoples R China
[2] Key Lab Ubiquitous Network & Serv Software Liaonin, Dalian 116024, Peoples R China
[3] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[4] Sichuan Univ, Dept Comp Sci, Chengdu 610017, Peoples R China
[5] Dalian Univ Technol, Int Sch Informat Sci & Engn, Key Lab Ubiquitous Network & Serv Software Liaonin, Dalian 116024, Peoples R China
[6] Huazhong Univ Sci & Technol, Sch Cyber Sci & Engn, Hubei Engn Res Centeron Big Data Secur, Wuhan 430074, Peoples R China
[7] Cardiff Univ, Phys Sci & Engn Coll, Cardiff CF10 3AT, Wales
[8] China Coal Res Inst, Ningxia Res Inst, Yinchuan 750004, Ningxia, Peoples R China
基金
中国国家自然科学基金;
关键词
Energy minimization; federated learning; machine learning based algorithms; mobile edge computing; UE selection and aggregator placement;
D O I
10.1109/TMC.2023.3262829
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 third 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.
引用
收藏
页码:2470 / 2485
页数:16
相关论文
共 50 条
  • [1] Near-Optimal Node Selection Procedure for Aging Monitor Placement
    Sadeghi-Kohan, Somayeh
    Vafaei, Arash
    Navabi, Zainalabedin
    2018 IEEE 24TH INTERNATIONAL SYMPOSIUM ON ON-LINE TESTING AND ROBUST SYSTEM DESIGN (IOLTS 2018), 2018, : 6 - 11
  • [2] MEC-A Near-Optimal Online Reinforcement Learning Algorithm for Continuous Deterministic Systems
    Zhao, Dongbin
    Zhu, Yuanheng
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2015, 26 (02) : 346 - 356
  • [3] Statistically Near-Optimal Hypothesis Selection
    Bousquet, Olivier
    Braverman, Mark
    Kol, Gillat
    Efremenko, Klim
    Moran, Shay
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 909 - 919
  • [4] AN ALGORITHM FOR NEAR-OPTIMAL PLACEMENT OF SENSOR ELEMENTS
    PEARSON, D
    PILLAI, SU
    LEE, YJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) : 1280 - 1284
  • [5] A near-optimal mechanism for impartial selection
    Bousquet, Nicolas
    Norin, Sergey
    Vetta, Adrian
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8877 : 133 - 146
  • [6] Near-Optimal Instruction Selection on DAGs
    Koes, David Ryan
    Goldstein, Seth Copen
    CGO 2008: SIXTH INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, PROCEEDINGS, 2008, : 45 - 54
  • [7] A Near-Optimal Mechanism for Impartial Selection
    Bousquet, Nicolas
    Norin, Sergey
    Vetta, Adrian
    WEB AND INTERNET ECONOMICS, 2014, 8877 : 133 - 146
  • [8] Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement
    Zhang, Xiaoning
    Xu, Zhichao
    Fan, Lang
    Yu, Shui
    Qu, Youyang
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2022, 10 (01) : 553 - 567
  • [9] Optimal User Selection for High-Performance and Stabilized Energy-Efficient Federated Learning Platforms
    Jeon, Joohyung
    Park, Soohyun
    Choi, Minseok
    Kim, Joongheon
    Kwon, Young-Bin
    Cho, Sungrae
    ELECTRONICS, 2020, 9 (09) : 1 - 17
  • [10] Age-Aware Data Selection and Aggregator Placement for Timely Federated Continual Learning in Mobile Edge Computing
    Xu, Zichuan
    Wang, Lin
    Liang, Weifa
    Xia, Qiufen
    Xu, Wenzheng
    Zhou, Pan
    Rana, Omer F.
    IEEE TRANSACTIONS ON COMPUTERS, 2024, 73 (02) : 466 - 480