Pith. sign in

REVIEW 1 cited by

LEASGD: an Efficient and Privacy-Preserving Decentralized Algorithm for Distributed Learning

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 1811.11124 v1 pith:NUKFX6ZL submitted 2018-11-27 cs.LG stat.ML

classification cs.LGstat.ML
keywords learningleasgdprivacyalgorithmdecentralizeddifferentialdistributedachieve
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Distributed learning systems have enabled training large-scale models over large amount of data in significantly shorter time. In this paper, we focus on decentralized distributed deep learning systems and aim to achieve differential privacy with good convergence rate and low communication cost. To achieve this goal, we propose a new learning algorithm LEASGD (Leader-Follower Elastic Averaging Stochastic Gradient Descent), which is driven by a novel Leader-Follower topology and a differential privacy model.We provide a theoretical analysis of the convergence rate and the trade-off between the performance and privacy in the private setting.The experimental results show that LEASGD outperforms state-of-the-art decentralized learning algorithm DPSGD by achieving steadily lower loss within the same iterations and by reducing the communication cost by 30%. In addition, LEASGD spends less differential privacy budget and has higher final accuracy result than DPSGD under private setting.

Discussion (0). Continue with ORCID 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. Dyn-D$^2$P: Dynamic Differentially Private Decentralized Learning with Provable Utility Guarantee

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Dyn-D2P dynamically adjusts DP noise and gradient clipping in decentralized learning, with a 1/sqrt(n) utility rate on top of an unquantified clipping bias.

Pith tools