Pith. sign in

REVIEW 1 cited by

Corrected with the Latest Version: Make Robust Asynchronous Federated Learning Possible

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 2504.04081 v2 pith:ZQ2Q44VB submitted 2025-04-05 cs.LG cs.DC

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

As an emerging paradigm of federated learning, asynchronous federated learning offers significant speed advantages over traditional synchronous federated learning. Unlike synchronous federated learning, which requires waiting for all clients to complete updates before aggregation, asynchronous federated learning aggregates the models that have arrived in realtime, greatly improving training speed. However, this mechanism also introduces the issue of client model version inconsistency. When the differences between models of different versions during aggregation become too large, it may lead to conflicts, thereby reducing the models accuracy. To address this issue, this paper proposes an asynchronous federated learning version correction algorithm based on knowledge distillation, named FedADT. FedADT applies knowledge distillation before aggregating gradients, using the latest global model to correct outdated information, thus effectively reducing the negative impact of outdated gradients on the training process. Additionally, FedADT introduces an adaptive weighting function that adjusts the knowledge distillation weight according to different stages of training, helps mitigate the misleading effects caused by the poorer performance of the global model in the early stages of training. This method significantly improves the overall performance of asynchronous federated learning without adding excessive computational overhead. We conducted experimental comparisons with several classical algorithms, and the results demonstrate that FedADT achieves significant improvements over other asynchronous methods and outperforms all methods in terms of convergence speed.

Discussion (0). Sign in 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. AFBS:Buffer Gradient Selection in Semi-asynchronous Federated Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    AFBS scores buffered gradients by staleness and dataset size, discards low-value ones, and clusters clients through random-projection-encrypted label distributions before aggregation in semi-asynchronous federated learning.

Pith tools