REVIEW 4 cited by
Overcoming Forgetting in Federated Learning on Non-IID Data
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
read the original abstract
We tackle the problem of Federated Learning in the non i.i.d. case, in which local models drift apart, inhibiting learning. Building on an analogy with Lifelong Learning, we adapt a solution for catastrophic forgetting to Federated Learning. We add a penalty term to the loss function, compelling all local models to converge to a shared optimum. We show that this can be done efficiently for communication (adding no further privacy risks), scaling with the number of nodes in the distributed setting. Our experiments show that this method is superior to competing ones for image recognition on the MNIST dataset.
Forward citations
Cited by 4 Pith papers
-
Benchmark Evaluation of Federated Learning on Multi-organ Images
MobenFL is the broadest federated medical-imaging benchmark to date, pairing 20 algorithms with 22 multi-organ datasets and adding efficiency plus privacy metrics.
-
SFedKD: Sequential Federated Learning with Discrepancy-Aware Multi-Teacher Knowledge Distillation
SFedKD uses discrepancy-weighted multi-teacher knowledge distillation and greedy teacher selection to reduce catastrophic forgetting in sequential federated learning.
-
Mitigating Catastrophic Forgetting with Adaptive Transformer Block Expansion in Federated Fine-Tuning
FedBE appends zero-initialized transformer blocks to selected layers and allocates them across clients by resource and data profiles, reporting 12-74% better knowledge retention and 1.9-3.1x faster convergence in fede...
-
Accelerated Training of Federated Learning via Second-Order Methods
A survey that categorizes second-order federated learning methods and argues they reduce communication rounds, based on results borrowed from the cited papers rather than new experiments.
Discussion (0). Sign in to comment.