WFLTree: A Spanning Tree Construction for Federated Learning in Wireless Networks

Abstract

Nowadays, more and more federated learning algorithms have been implemented in edge computing, to provide various customized services for mobile users, which has strongly supported the rapid development of edge intelligence. However, most of them are designed relying on the reliable device-to-device communications, which is not a realistic assumption in the wireless environment. This paper considers a realistic aggregation problem for federated learning in a single-hop wireless network, in which the parameters of machine learning models are aggregated from the learning agents to a parameter server via a wireless channel with physical interference constraint. Assuming that all the learning agents and the parameter server are within a distance [Formula: see text] from each other, we show that it is possible to construct a spanning tree to connect all the learning agents to the parameter server for federated learning within [Formula: see text] time steps. After the spanning tree is constructed, it only takes [Formula: see text] time steps to aggregate all the training parameters from the learning agents to the parameter server. Thus, the server can update its machine learning model once according to the aggregated results. Theoretical analyses and numerical simulations are conducted to show the performance of our algorithm.