Pith. sign in

REVIEW 1 cited by

FedKD: Communication Efficient Federated Learning via Knowledge Distillation

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 2108.13323 v2 pith:WDGHE2LY submitted 2021-08-30 cs.LG cs.CL

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

Federated learning is widely used to learn intelligent models from decentralized data. In federated learning, clients need to communicate their local model updates in each iteration of model learning. However, model updates are large in size if the model contains numerous parameters, and there usually needs many rounds of communication until model converges. Thus, the communication cost in federated learning can be quite heavy. In this paper, we propose a communication efficient federated learning method based on knowledge distillation. Instead of directly communicating the large models between clients and server, we propose an adaptive mutual distillation framework to reciprocally learn a student and a teacher model on each client, where only the student model is shared by different clients and updated collaboratively to reduce the communication cost. Both the teacher and student on each client are learned on its local data and the knowledge distilled from each other, where their distillation intensities are controlled by their prediction quality. To further reduce the communication cost, we propose a dynamic gradient approximation method based on singular value decomposition to approximate the exchanged gradients with dynamic precision. Extensive experiments on benchmark datasets in different tasks show that our approach can effectively reduce the communication cost and achieve competitive results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Hypernetworks for Model-Heterogeneous Personalized Federated Learning

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A server-side multi-head hypernetwork generates personalized parameters for clients with heterogeneous model architectures, plus an optional global-model distillation variant, and beats several pFL baselines on four b...

Pith tools