论文标题
无线联合学习网络中的客户选择和带宽分配:长期观点
Client Selection and Bandwidth Allocation in Wireless Federated Learning Networks: A Long-Term Perspective
论文作者
论文摘要
本文研究了经典的无线网络中联合学习(FL),在该网络中,学习客户端共享与协调服务器的常见无线链接,以使用其本地数据进行联合模型培训。在这样的无线联合学习网络(WFLN)中,优化学习绩效至关重要地取决于选择客户的选择以及在每个学习回合中如何分配带宽,因为无线电和客户的能源资源都受到限制。尽管现有作品已经尝试分配有限的无线资源来优化FL,但它们专注于单个学习回合中的问题,忽略了联合学习的固有而固有的特征。本文为WFLN中的资源分配带来了新的长期观点,意识到学习巡回赛不仅在时间上相互依存,而且对最终学习成果具有不同的意义。为此,我们首先设计了以数据为基础的实验,以表明不同的时间客户选择模式会导致相当不同的学习绩效。有了获得的见解,我们在长期客户能源约束下为共同的客户选择和带宽分配制定了随机优化问题,并开发了一种新算法,该算法仅利用当前可用的无线通道信息,但可以实现长期性能保证。进一步的实验表明,我们的算法会导致所需的时间客户选择模式,适应不断变化的网络环境,并且远远超过忽略FL的长期效果的基准。
This paper studies federated learning (FL) in a classic wireless network, where learning clients share a common wireless link to a coordinating server to perform federated model training using their local data. In such wireless federated learning networks (WFLNs), optimizing the learning performance depends crucially on how clients are selected and how bandwidth is allocated among the selected clients in every learning round, as both radio and client energy resources are limited. While existing works have made some attempts to allocate the limited wireless resources to optimize FL, they focus on the problem in individual learning rounds, overlooking an inherent yet critical feature of federated learning. This paper brings a new long-term perspective to resource allocation in WFLNs, realizing that learning rounds are not only temporally interdependent but also have varying significance towards the final learning outcome. To this end, we first design data-driven experiments to show that different temporal client selection patterns lead to considerably different learning performance. With the obtained insights, we formulate a stochastic optimization problem for joint client selection and bandwidth allocation under long-term client energy constraints, and develop a new algorithm that utilizes only currently available wireless channel information but can achieve long-term performance guarantee. Further experiments show that our algorithm results in the desired temporal client selection pattern, is adaptive to changing network environments and far outperforms benchmarks that ignore the long-term effect of FL.