Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Energy or accuracy? Near-optimal user selection and aggregator placement for federated learning in MEC

Xu, Zichuan, Li, Dongrui, Liang, Weifa, Xu, Wenzheng, Xia, Qiufen, Zhou, Pan, Rana, Omer F. ORCID: https://orcid.org/0000-0003-3597-2646 and Li, Hao 2024. Energy or accuracy? Near-optimal user selection and aggregator placement for federated learning in MEC. IEEE Transactions on Mobile Computing 23 (3) , pp. 2470-2485. 10.1109/TMC.2023.3262829

Full text not available from this repository.

Abstract

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 thirdly 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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: Institute of Electrical and Electronics Engineers
ISSN: 1536-1233
Date of Acceptance: 16 March 2023
Last Modified: 26 Mar 2024 13:18
URI: https://orca.cardiff.ac.uk/id/eprint/158241

Actions (repository staff only)

Edit Item Edit Item