REVIEW 2 cited by
Decentralized Federated Learning: A Survey and Perspective
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
Federated learning (FL) has been gaining attention for its ability to share knowledge while maintaining user data, protecting privacy, increasing learning efficiency, and reducing communication overhead. Decentralized FL (DFL) is a decentralized network architecture that eliminates the need for a central server in contrast to centralized FL (CFL). DFL enables direct communication between clients, resulting in significant savings in communication resources. In this paper, a comprehensive survey and profound perspective are provided for DFL. First, a review of the methodology, challenges, and variants of CFL is conducted, laying the background of DFL. Then, a systematic and detailed perspective on DFL is introduced, including iteration order, communication protocols, network topologies, paradigm proposals, and temporal variability. Next, based on the definition of DFL, several extended variants and categorizations are proposed with state-of-the-art (SOTA) technologies. Lastly, in addition to summarizing the current challenges in the DFL, some possible solutions and future research directions are also discussed.
Forward citations
Cited by 2 Pith papers
-
Loss-Guided Model Sharing and Local Learning Correction in Decentralized Federated Learning for Crop Disease Classification
The paper proposes a peer-to-peer federated learning framework with validation-loss-based model sharing and a weighted loss-correction term, but the correction term has zero gradient and the experiments show implausib...
-
GLow -- A Novel, Flower-Based Simulated Gossip Learning Strategy
GLow implements and simulates fully decentralized gossip learning in the Flower framework, achieving competitive accuracy with centralized and federated baselines on MNIST and CIFAR10.
Discussion (0). Continue with ORCID to comment.