论文标题
联合资源分配,以最大程度地减少无细胞大型MIMO中联合学习的执行时间
Joint Resource Allocation to Minimize Execution Time of Federated Learning in Cell-Free Massive MIMO
论文作者
论文摘要
由于其沟通效率和保护隐私的能力,联邦学习(FL)已成为5G和Bebeyond无线网络中机器学习的有前途的框架。令人兴奋的是设计和优化新的无线网络结构,这些结构支持FL的稳定和快速运行。无细胞的大规模多输入多输出(CFMMIMO)被证明是合适的候选者,它允许在迭代FL过程中稳定执行的每个通信过程。旨在减少CFMMIMO中FL过程的总执行时间,本文提议仅选择一部分可用用户参加FL。具有良好链接条件的最佳用户选择将最大程度地减少每个通信回合的执行时间,同时限制所需的通信总数。为此,我们制定了用户选择,传输功率和处理频率的联合优化问题,但要遵守预定义的参与用户数量,以保证学习质量。然后,我们开发了一种新算法,该算法被证明可以融合到配制问题的固定点的附近。数值结果证实,我们提出的方法大大减少了基线方案的总执行时间。当访问点部署的密度中等较低时,时间缩短更为明显。
Due to its communication efficiency and privacy-preserving capability, federated learning (FL) has emerged as a promising framework for machine learning in 5G-and-beyond wireless networks. Of great interest is the design and optimization of new wireless network structures that support the stable and fast operation of FL. Cell-free massive multiple-input multiple-output (CFmMIMO) turns out to be a suitable candidate, which allows each communication round in the iterative FL process to be stably executed within a large-scale coherence time. Aiming to reduce the total execution time of the FL process in CFmMIMO, this paper proposes choosing only a subset of available users to participate in FL. An optimal selection of users with favorable link conditions would minimize the execution time of each communication round, while limiting the total number of communication rounds required. Toward this end, we formulate a joint optimization problem of user selection, transmit power, and processing frequency, subject to a predefined minimum number of participating users to guarantee the quality of learning. We then develop a new algorithm that is proven to converge to the neighbourhood of the stationary points of the formulated problem. Numerical results confirm that our proposed approach significantly reduces the FL total execution time over baseline schemes. The time reduction is more pronounced when the density of access point deployments is moderately low.