Federated Learning Over Hierarchical Wireless Networks: Training Latency Minimization via Submodel Partitioning
Hierarchical federated learning (HFL) has demonstrated promising scalability advantages over the traditional “star-topology” architecture-based federated learning (FL). However, HFL still imposes significant computation, communication, and storage burdens on the edge, especially when training a large-scale model over resource-constrained wireless devices. In this paper, we propose hierarchical independent submodel training (<monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace>), a new FL methodology that aims to address these issues in hierarchical cloud-edge-client networks. The key idea behind <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace> is to divide the global model into disjoint partitions (or submodels) per round so that each group of clients (i.e., cells) is responsible for training only one partition of the model. We characterize the convergence behavior of <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace> under mild assumptions, showing the impacts of several key attributes (e.g., submodel sizes, number of cells, edge and global aggregation frequencies) on the rate and stationarity gap. Building upon the theoretical results, we propose a submodel partitioning strategy to minimize the training latency depending on network resource availability and a target learning performance guarantee. We then demonstrate how <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace> can be augmented with over-the-air computation (AirComp) to further enhance the efficiency of the model aggregation over the edge cells. Through numerical evaluations, we verify that <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace> is able to save training time and communication costs by wide margins while achieving comparable accuracy as conventional HFL. Moreover, our experiments demonstrate that AirComp-assisted <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">HIST</monospace> provides further improvements in training latency.
Authors
- Wenzhi Fang (ORCID: https://orcid.org/0000-0003-3013-8978)
- Christopher G. Brinton (ORCID: https://orcid.org/0000-0003-2771-3521)
- Dong-Jun Han (ORCID: https://orcid.org/0000-0003-2970-7336)
Institutions
- Yonsei University (KR)
- Purdue University West Lafayette (US)
Publication Details
- Journal
- IEEE Transactions on Networking
- Published
- 2025-03-11
- DOI
- https://doi.org/10.1109/ton.2025.3538661
- Citations
- 5
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 7.44
Funders
- National Science Foundation
- Defense Advanced Research Projects Agency
- Office of Naval Research