Pith. sign in

REVIEW 1 cited by

The Privacy Power of Correlated Noise in Decentralized 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 2405.01031 v2 pith:4OFYWCUW submitted 2024-05-02 cs.LG cs.CRcs.DCmath.OCstat.ML

classification cs.LGcs.CRcs.DCmath.OCstat.ML
keywords privacyuserscorrelateddecentralizeddecoreverycentralcommunication
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Decentralized learning is appealing as it enables the scalable usage of large amounts of distributed data and resources (without resorting to any central entity), while promoting privacy since every user minimizes the direct exposure of their data. Yet, without additional precautions, curious users can still leverage models obtained from their peers to violate privacy. In this paper, we propose Decor, a variant of decentralized SGD with differential privacy (DP) guarantees. Essentially, in Decor, users securely exchange randomness seeds in one communication round to generate pairwise-canceling correlated Gaussian noises, which are injected to protect local models at every communication round. We theoretically and empirically show that, for arbitrary connected graphs, Decor matches the central DP optimal privacy-utility trade-off. We do so under SecLDP, our new relaxation of local DP, which protects all user communications against an external eavesdropper and curious users, assuming that every pair of connected users shares a secret, i.e., an information hidden to all others. The main theoretical challenge is to control the accumulation of non-canceling correlated noise due to network sparsity. We also propose a companion SecLDP privacy accountant for public use.

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. Dropout-Robust Mechanisms for Differentially Private and Fully Decentralized Mean Estimation

    cs.CR 2025-06 conditional novelty 7.0 of 10

    IncA is a fully decentralized, differentially private mean-estimation protocol whose correlated noise cancels in the no-dropout case, achieving central-DP accuracy under a strong adversarial model.

Pith tools