Pith. sign in

REVIEW 8 cited by

HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.01264 v3 pith:5UUKSKRS submitted 2020-10-03 cs.LG stat.ML

HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients

classification cs.LG stat.ML
keywords computationclientsheterogeneouslearningcommunicationfederatedmodelmodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Federated Learning (FL) is a method of training machine learning models on private data distributed over a large number of possibly heterogeneous clients such as mobile phones and IoT devices. In this work, we propose a new federated learning framework named HeteroFL to address heterogeneous clients equipped with very different computation and communication capabilities. Our solution can enable the training of heterogeneous local models with varying computation complexities and still produce a single global inference model. For the first time, our method challenges the underlying assumption of existing work that local models have to share the same architecture as the global model. We demonstrate several strategies to enhance FL training and conduct extensive empirical evaluations, including five computation complexity levels of three model architecture on three datasets. We show that adaptively distributing subnetworks according to clients' capabilities is both computation and communication efficient.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers

    cs.LG 2026-06 unverdicted novelty 7.0

    Gradient clipping eliminates the dependence on maximum delay in the oracle complexity of asynchronous SGD, yielding convergence in expectation and high probability under sub-Weibull gradient noise.

  2. Rashomon Sets and Model Multiplicity in Federated Learning

    cs.LG 2026-02 unverdicted novelty 7.0

    The work provides the first formal definitions of Rashomon sets for federated learning and introduces a multiplicity-aware training pipeline evaluated on standard benchmarks.

  3. Collate: Collaborative Neural Network Learning for Latency-Critical Edge Systems

    cs.LG 2026-07 conditional novelty 5.5

    Collate jointly trains heterogeneous models under per-device latency constraints via dynamic zeroizing-recovering and proto-corrected aggregation, gaining ~2–3% accuracy over prior heterogeneous FL.

  4. HASA: Subnet Allocation for Compute-Constrained Model-Heterogeneous Federated Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    HASA computes client heterogeneity scores from local data and assigns wider subnets to less heterogeneous clients, raising mean client test accuracy from 13.82% to 14.32% and improving worst-client accuracy versus uni...

  5. FedPLT: Scalable, Resource-Efficient, and Heterogeneity-Aware Federated Learning via Partial Layer Training

    cs.DC 2026-05 unverdicted novelty 5.0

    FedPLT assigns client-specific model layers for training and matches or beats full-model federated learning accuracy with 71-82 percent fewer trainable parameters per client.

  6. Representation-Aligned Multi-Scale Personalization for Federated Learning

    cs.LG 2026-04 unverdicted novelty 5.0

    FRAMP generates client-specific models from compact descriptors in federated learning, trains tailored submodels, and aligns representations to balance personalization with global consistency.

  7. Semantic-based Distributed Learning for Diverse and Discriminative Representations

    cs.LG 2026-04 unverdicted novelty 4.0

    A new distributed optimization method enforces diverse and discriminative representations via variance constraints for i.i.d. data and node clustering for non-i.i.d. data, with theoretical guarantees and semantic sharing.

  8. Knowledge Distillation in Federated Learning: a Survey on Long Lasting Challenges and New Solutions

    cs.LG 2024-06 unverdicted novelty 2.0

    A survey organizing knowledge distillation techniques for addressing privacy, heterogeneity, communication, and personalization challenges in federated learning.