Pith. sign in

REVIEW 2 cited by

Efficient Model Compression for Hierarchical Federated Learning

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 2405.17522 v1 pith:ICVSJGCA submitted 2024-05-27 cs.LG cs.DC

classification cs.LGcs.DC
keywords modellearningclientscompressionsystemsaggregationalgorithmclient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning (FL), as an emerging collaborative learning paradigm, has garnered significant attention due to its capacity to preserve privacy within distributed learning systems. In these systems, clients collaboratively train a unified neural network model using their local datasets and share model parameters rather than raw data, enhancing privacy. Predominantly, FL systems are designed for mobile and edge computing environments where training typically occurs over wireless networks. Consequently, as model sizes increase, the conventional FL frameworks increasingly consume substantial communication resources. To address this challenge and improve communication efficiency, this paper introduces a novel hierarchical FL framework that integrates the benefits of clustered FL and model compression. We present an adaptive clustering algorithm that identifies a core client and dynamically organizes clients into clusters. Furthermore, to enhance transmission efficiency, each core client implements a local aggregation with compression (LC aggregation) algorithm after collecting compressed models from other clients within the same cluster. Simulation results affirm that our proposed algorithms not only maintain comparable predictive accuracy but also significantly reduce energy consumption relative to existing FL mechanisms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Efficient Federated Learning with Encrypted Data Sharing for Data-Heterogeneous Edge Devices

    cs.LG 2025-06 conditional novelty 6.0 of 10

    FedEDS lets federated learning clients share data encrypted via a stochastic layer, improving accuracy and cutting communication rounds under data heterogeneity.

  2. Federated Split Learning with Improved Communication and Storage Efficiency

    cs.LG 2025-07 conditional novelty 4.0 of 10

    CSE-FSL combines an auxiliary network for local updates with periodic smashed-data uploads and a single server-side model, claiming convergence under non-convex loss and lower communication and storage costs.

Pith tools