Pegasus: Efficient Asynchronous Three-Layer Federated Learning

Compared to conventional two-layer federated learning (FL), three-layer FL, which adds a layer of edge servers between the central server and clients, is less studied but could provide better training performance in terms of reducing elapsed wall-clock time to complete training. However, three-layer FL inherits and magnifies some inherent challenges in two-layer FL, such as client heterogeneity. With different computing capabilities and network connections, slow clients require exceedingly long training times. To alleviate the negative effect due to slow clients, this paper is the first to study asynchronous three-layer FL, where edge servers conduct local aggregation without waiting for slow clients and the central server aggregates updates from fast edge servers. Unfortunately, asynchronous three-layer FL could suffer from performance degradation as when aggregating updates from slow clients and edge servers, those updates are not computed based on the newest global model. Therefore, we propose a staleness-aware framework, Pegasus, with newly designed client selection, compression, and update aggregation mechanisms to improve every important aspect during training. Our extensive evaluation of different training tasks demonstrates that Pegasus can achieve a reduction in elapsed wall-clock training time by at least 46.8% with an increase in converged accuracy of the trained global model by up to 0.3% as compared to the state-of-the-art.

Authors

Institutions

Publication Details

Published
2025-08-04
DOI
https://doi.org/10.1109/icccn65249.2025.11133903
Primary Topic
Cooperative Communication and Network Coding
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pegasus: Efficient Asynchronous Three-Layer Federated Learning

Chen Ying, Baochun Li
1 links
Cooperative Communication and Network Coding
article

Pegasus: Efficient Asynchronous Three-Layer Federated Learning

Chen Ying, Baochun Li
article en

Abstract

Compared to conventional two-layer federated learning (FL), three-layer FL, which adds a layer of edge servers between the central server and clients, is less studied but could provide better training performance in terms of reducing elapsed wall-clock time to complete training. However, three-layer FL inherits and magnifies some inherent challenges in two-layer FL, such as client heterogeneity. With different computing capabilities and network connections, slow clients require exceedingly long training times. To alleviate the negative effect due to slow clients, this paper is the first to study asynchronous three-layer FL, where edge servers conduct local aggregation without waiting for slow clients and the central server aggregates updates from fast edge servers. Unfortunately, asynchronous three-layer FL could suffer from performance degradation as when aggregating updates from slow clients and edge servers, those updates are not computed based on the newest global model. Therefore, we propose a staleness-aware framework, Pegasus, with newly designed client selection, compression, and update aggregation mechanisms to improve every important aspect during training. Our extensive evaluation of different training tasks demonstrates that Pegasus can achieve a reduction in elapsed wall-clock training time by at least 46.8% with an increase in converged accuracy of the trained global model by up to 0.3% as compared to the state-of-the-art.

University of Toronto (CA)
Openalex Percentile: Top 74%
Cooperative Communication and Network Coding
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.