论文标题

基于MAB的客户选择用于联合学习,并在移动网络中提供不确定的资源

MAB-based Client Selection for Federated Learning with Uncertain Resources in Mobile Networks

论文作者

Yoshida, Naoya, Nishio, Takayuki, Morikura, Masahiro, Yamamoto, Koji

论文摘要

本文提出了一种无法估计客户的计算和通信资源时,用于联合学习(FL)的客户选择方法;该方法使用移动客户端的丰富数据和计算资源训练机器学习(ML)模型,而无需在中央系统中收集数据。带有客户选择的常规FL估计了从给定客户的计算功率和吞吐量中FL的所需时间,并确定客户设置以减少FL回合的时间消耗。但是,在进行FL过程之前,很难为所有客户提供准确的资源信息,因为可用的计算和通信资源根据背景计算任务,背景流量,瓶颈链接等轻松更改。因此,FL操作员必须通过探索和开发过程选择客户。本文提出了一种基于多臂强盗(MAB)的客户选择方法,以解决探索和剥削权衡取舍,并减少移动网络中FL的时间消耗。所提出的方法平衡了资源数量不确定的客户的选择,并且已知资源数量大量。模拟评估表明,在资源波动的情况下,所提出的方案比常规方法需要更少的学习时间。

This paper proposes a client selection method for federated learning (FL) when the computation and communication resource of clients cannot be estimated; the method trains a machine learning (ML) model using the rich data and computational resources of mobile clients without collecting their data in central systems. Conventional FL with client selection estimates the required time for an FL round from a given clients' computation power and throughput and determines a client set to reduce time consumption in FL rounds. However, it is difficult to obtain accurate resource information for all clients before the FL process is conducted because the available computation and communication resources change easily based on background computation tasks, background traffic, bottleneck links, etc. Consequently, the FL operator must select clients through exploration and exploitation processes. This paper proposes a multi-armed bandit (MAB)-based client selection method to solve the exploration and exploitation trade-off and reduce the time consumption for FL in mobile networks. The proposed method balances the selection of clients for which the amount of resources is uncertain and those known to have a large amount of resources. The simulation evaluation demonstrated that the proposed scheme requires less learning time than the conventional method in the resource fluctuating scenario.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源