Pith. sign in

REVIEW 1 cited by

Optimizing Privacy-Utility Trade-off in Decentralized Learning with Generalized Correlated Noise

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 2501.14644 v2 pith:4O4ADOIN submitted 2025-01-24 cs.LG cs.AIcs.CRcs.DC

classification cs.LGcs.AIcs.CRcs.DC
keywords noiselearninglocalcorn-dsgdprivacyagentagentsartificial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Decentralized learning enables distributed agents to collaboratively train a shared machine learning model without a central server, through local computation and peer-to-peer communication. Although each agent retains its dataset locally, sharing local models can still expose private information about the local training datasets to adversaries. To mitigate privacy attacks, a common strategy is to inject random artificial noise at each agent before exchanging local models between neighbors. However, this often leads to utility degradation due to the negative effects of cumulated artificial noise on the learning algorithm. In this work, we introduce CorN-DSGD, a novel covariance-based framework for generating correlated privacy noise across agents, which unifies several state-of-the-art methods as special cases. By leveraging network topology and mixing weights, CorN-DSGD optimizes the noise covariance to achieve network-wide noise cancellation. Experimental results show that CorN-DSGD cancels more noise than existing pairwise correlation schemes, improving model performance under formal privacy guarantees.

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. Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication

    cs.IT 2025-07 conditional novelty 6.0 of 10

    SecCoGC combines cooperative gradient coding with real-field zero-sum privacy noise, giving exact global model reconstruction in federated learning under unreliable communication without a privacy-utility trade-off.

Pith tools