Papers › ProgFed: Effective, Communication, and Computation Efficient Federated Learning by...

ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive Training

11 Oct 2021arXiv:2110.05323archive 2025-07-28

Hui-Po Wang, Sebastian U. Stich, Yang He, Mario Fritz

Federated learning is a powerful distributed learning scheme that allows numerous edge devices to collaboratively train a model without sharing their data. However, training is resource-intensive for edge devices, and limited network bandwidth is often the main bottleneck. Prior work often overcomes the constraints by condensing the models or messages into compact formats, e.g., by gradient compression or distillation. In contrast, we propose ProgFed, the first progressive training framework for efficient and effective federated learning. It inherently reduces computation and two-way communication costs while maintaining the strong performance of the final models. We theoretically prove that ProgFed converges at the same asymptotic rate as standard training on full models. Extensive results on a broad range of architectures, including CNNs (VGG, ResNet, ConvNets) and U-nets, and diverse tasks from simple classification to medical image segmentation show that our highly effective training approach saves up to 20% computation and up to 63% communication costs for converged models. As our approach is also complimentary to prior work on compression, we can achieve a wide range of trade-offs by combining these techniques, showing reduced communication of up to 50× at only 0.1% loss in utility. Code is available at https://github.com/hui-po-wang/ProgFed.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2110.05323")

Code

Syntology Ran 1 of 17 code samples harvested from 2 repositories linked to this paper; 16 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

By repository: official repository: 17 samples from 2 repositories, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

a514514772/progfed officialmentioned in papermentioned on GitHubpytorch report
hui-po-wang/progfed officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 1 ran; 0 honoured the contract we drafted; 16 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
16unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

hadamard_rotation_reverse a514514772/progfed/fl_utils.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · fc505935053e95fd · report
accuracy hui-po-wang/progfed/utils.py official repository unverified MIT (permissive) · bc52bc416489dfab · report
add_dp_noise hui-po-wang/progfed/quantization.py official repository unverified MIT (permissive) · b6d18bda1a223527 · report
combine_dequantization a514514772/progfed/fl_utils.py official repository unverified MIT (permissive) · 802e94968a21f96e · report
combine_quantization hui-po-wang/progfed/quantization.py official repository unverified MIT (permissive) · e74b43ecaac25ae7 · report
convnet hui-po-wang/progfed/models/convnet.py official repository unverified MIT (permissive) · 18e31c431c76dd56 · report
get_outdim hui-po-wang/progfed/models/model_utils.py official repository unverified MIT (permissive) · 1dec658fa1c9eb5f · report
linear_dequantization a514514772/progfed/fl_utils.py official repository unverified MIT (permissive) · 0a5d4af66055e016 · report
loss_prox hui-po-wang/progfed/fl_utils.py official repository unverified MIT (permissive) · 9256737dcb816d37 · report
make_layers hui-po-wang/progfed/models/vgg.py official repository unverified MIT (permissive) · 2e9f2a01123f7bb8 · report
noniid hui-po-wang/progfed/fl_utils.py official repository unverified MIT (permissive) · 211d11b1d33333e4 · report
resnet18 hui-po-wang/progfed/models/resnet.py official repository unverified MIT (permissive) · 985e0af71e7442e3 · report
resnet34 hui-po-wang/progfed/models/resnet.py official repository unverified MIT (permissive) · a465e5dfb7d431b1 · report
resnet50 hui-po-wang/progfed/models/resnet.py official repository unverified MIT (permissive) · 564cac17d754ae0f · report
update_model_global_optim a514514772/progfed/fl_utils.py official repository unverified MIT (permissive) · 8af2a79bfe0213c9 · report
vgg11_bn hui-po-wang/progfed/models/vgg.py official repository unverified MIT (permissive) · 305019eddb7a5f28 · report
vgg13_bn hui-po-wang/progfed/models/vgg.py official repository unverified MIT (permissive) · 20e419cb19c5a145 · report

Tasks

Federated LearningImage SegmentationMedical Image SegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConvolutionGlobal Average PoolingKaiming InitializationMax PoolingReLUResidual BlockResidual Connection

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections