Pith. sign in

REVIEW 2 cited by

Federated Learning with Unbiased Gradient Aggregation and Controllable Meta Updating

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 1910.08234 v3 pith:BG3D46SL submitted 2019-10-18 cs.LG cs.DCstat.ML

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

Federated learning (FL) aims to train machine learning models in the decentralized system consisting of an enormous amount of smart edge devices. Federated averaging (FedAvg), the fundamental algorithm in FL settings, proposes on-device training and model aggregation to avoid the potential heavy communication costs and privacy concerns brought by transmitting raw data. However, through theoretical analysis we argue that 1) the multiple steps of local updating will result in gradient biases and 2) there is an inconsistency between the expected target distribution and the optimization objectives following the training paradigm in FedAvg. To tackle these problems, we first propose an unbiased gradient aggregation algorithm with the keep-trace gradient descent and the gradient evaluation strategy. Then we introduce an additional controllable meta updating procedure with a small set of data samples, indicating the expected target distribution, to provide a clear and consistent optimization objective. Both the two improvements are model- and task-agnostic and can be applied individually or together. Experimental results demonstrate that the proposed methods are faster in convergence and achieve higher accuracy with different network architectures in various FL settings.

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. FedEve: On Bridging the Client Drift and Period Drift for Cross-device Federated Learning

    cs.LG 2025-08 reject novelty 4.0 of 10

    FedEve uses a Kalman filter to combine server momentum (prediction) with client updates (observation) to offset period drift and client drift in cross-device federated learning.

  2. A Privacy-Preserving Domain Adversarial Federated learning for multi-site brain functional connectivity analysis

    cs.LG 2025-02 reject novelty 4.0 of 10

    DAFed combines domain-adversarial training, feature disentanglement, and contrastive learning in a federated GCN framework to classify ASD and MCI from multi-site fMRI, claiming accuracy gains over existing federated ...

Pith tools