Dynamic Edge Association and Resource Allocation in Self-Organizing Hierarchical Federated Learning Networks

Abstract

Federated Learning (FL) is a promising privacy-preserving distributed machine learning paradigm. However, communication inefficiency remains the key bottleneck that impedes its large-scale implementation. Recently, hierarchical FL (HFL) has been proposed in which data owners, i.e., workers, can first transmit their updated model parameters to edge servers for intermediate aggregation. This reduces the instances of global communication and straggling workers. To enable efficient HFL, it is important to address the issues of edge association and resource allocation in the context of non-cooperative players, i.e., workers, edge servers, and model owner. However, the existing studies merely focus on static approaches and do not consider the dynamic interactions and bounded rationalities of the players. In this paper, we propose a hierarchical game framework to study the dynamics of edge association and resource allocation in self-organizing HFL networks. In the lower-level game, the edge association strategies of the workers are modelled using an evolutionary game. In the upper-level game, a Stackelberg differential game is adopted in which the model owner decides an optimal reward scheme given the expected bandwidth allocation control strategy of the edge server. Finally, we provide numerical results to validate that our proposed framework captures the HFL system dynamics under varying sources of network heterogeneity.