Pith. sign in

REVIEW 3 cited by

Decentralized Federated Averaging

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 2104.11375 v1 pith:JPQYWJSL submitted 2021-04-23 cs.DC stat.ML

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

Federated averaging (FedAvg) is a communication efficient algorithm for the distributed training with an enormous number of clients. In FedAvg, clients keep their data locally for privacy protection; a central parameter server is used to communicate between clients. This central server distributes the parameters to each client and collects the updated parameters from clients. FedAvg is mostly studied in centralized fashions, which requires massive communication between server and clients in each communication. Moreover, attacking the central server can break the whole system's privacy. In this paper, we study the decentralized FedAvg with momentum (DFedAvgM), which is implemented on clients that are connected by an undirected graph. In DFedAvgM, all clients perform stochastic gradient descent with momentum and communicate with their neighbors only. To further reduce the communication cost, we also consider the quantized DFedAvgM. We prove convergence of the (quantized) DFedAvgM under trivial assumptions; the convergence rate can be improved when the loss function satisfies the P{\L} property. Finally, we numerically verify the efficacy of DFedAvgM.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Reputation-driven Cooperation in Lattice-based Decentralized Federated Learning through Evolutionary Game Theory

    cs.AI 2026-08 reject novelty 5.0 of 10

    In a lattice-based simulation of decentralized federated learning, a reputation mechanism that rewards cooperators and penalizes defectors raises average accuracy from 70% to 82% and drives cooperation to near 100%.

  2. DFCA: Decentralized Federated Clustering Algorithm

    cs.LG 2025-10 conditional novelty 5.0 of 10

    DFCA decentralizes IFCA-style clustered federated learning: clients keep one model per cluster, train their assigned model locally, and exchange only that model with neighbors via a running average, matching centraliz...

  3. DP-FedLoRA: Privacy-Enhanced Federated Fine-Tuning for On-Device Large Language Models

    cs.CR 2025-09 reject novelty 3.0 of 10

    DP-FedLoRA clips and adds Gaussian noise to per-client LoRA matrices in federated LLM fine-tuning, claiming unbiased updates and bounded variance, but the privacy calibration and experiments have significant gaps.

Pith tools