SearcharxivSearch

arXiv subjects

Hangfan Li

Publications and source records attributed to Hangfan Li.

2 recordsLinked to original sources

Client Selection and Bandwidth Allocation for Federated Learning: An Online Optimization Perspective

Federated learning (FL) can train a global model from clients' local data set, which can make full use of the computing resources of clients and performs more extensive and efficient machine learning on clients with protecting user information requirements. Many existing works have focused on optimizing FL accuracy within the resource constrained in each individual round, however there are few works comprehensively consider the optimization for latency, accuracy and energy consumption over all rounds in wireless federated learning. Inspired by this, in this paper, we investigate FL in wireless network where client selection and bandwidth allocation are two crucial factors which significantly affect the latency, accuracy and energy consumption of clients. We formulate the optimization problem as a mixed-integer problem, which is to minimize the cost of time and accuracy within the long-term energy constrained over all rounds. To address this optimization, we propose the Perround Energy Drift Plus Cost (PEDPC) algorithm in an online perspective, and the performance of the PEDPC algorithm is verified in simulation results in terms of latency, accuracy and energy consumption in IID and NON-IID dat distributions.

cs.NI

A Multi-User Effective Computation Offloading Mechanism for MEC System: Batched Multi-Armed Bandits Approach

With the development of 5G technology, mobile edge computing (MEC) is becoming a useful architecture, which is envisioned as a cloud computing extension version. Users within MEC system could deal with data processing at edge terminals, which can reduce time for communication or data transmission. Multi-armed bandits (MAB) algorithms are powerful tools helping users offloading tasks to their best servers in MEC. However, as the number of users and tasks growing, the frequency of selecting servers and the cost of making decision is growing rapidly under traditional MAB algorithms. Inspired by this, in this paper, we propose a Batch-based Multi-user Server Elimination (BMSE) algorithm to solve such problem, which includes two sub-algorithms. We firstly propose a sub-algorithm in user level (BMSE-UL) to reduce the time cost. In BMSE-UL, users can simplify its own available server groups and offload tasks collectively. Then another sub-algorithm in system level (BMSE-SL) is proposed to reduce the frequency of making decision. In BMSE-SL, the system can cut down all the suboptimal task offloading actions and make the choosing option unique. Furthermore, we establish the optimality of the proposed algorithms by proving the sub-linearity convergence of their regrets and demonstrate the effectiveness of BMSE by extensive experiments.

cs.NI