PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 13, 2026IEEE Transactions on Pattern Analysis and Machine Intelligence0 citations

Privacy Preserving Decentralized Learning with Positive-Incentive Noise

View Full Paper
LWLuqing WangSYShaofu YangYWYong Wan

Key Points

  • The aim is to develop a privacy preserving method for decentralized learning that balances privacy and utility without compromising performance.
  • Introduced Positive-Incentive Noise Generator (PING) to reduce the negative effects of privacy noise.
  • Leveraged network topologies for generating correlated noise while using lightweight encryption-decryption operations.
  • Developed PP-DPIN, a stochastic algorithm integrating differential privacy and information entropy for decentralized learning.
  • Analyzed convergence rates in stochastic convex and nonconvex settings under privacy constraints.
  • PP-DPIN achieves strong privacy guarantees with at least half the nodes exhibiting robust privacy.
  • Demonstrated a linear speedup in convergence rate relative to network size.
  • Experimental results reveal PP-DPIN's superior performance against state-of-the-art algorithms for computer vision tasks.

Abstract

Ensuring the privacy of local datasets has emerged as an important concern in decentralized learning. However, the inherent privacy-utility tradeoff remains a fundamental challenge for privacy preserving decentralized algorithms. To address this issue, we introduce Positive-Incentive Noise Generator (PING), a novel mechanism designed to eliminate negative impact of privacy noise on convergence while defending against powerful colluding inference attacks. PING leverages network topologies and lightweight encryption-decryption operations to generate correlated noise. Building upon PING, we propose PP-DPIN, a privacy preserving stochastic algorithm tailored for decentralized learning. By integrating differential privacy and differential information entropy, we provide a comprehensive privacy quantification for PP-DPIN, with at least half nodes achieving arbitrarily strong privacy guarantees. Furthermore, convergence rate of PP-DPIN is established under stochastic convex and nonconvex settings, which characterizes the impact of privacy noise and demonstrates the linear speedup relative to the network size. Experiments on computer vision tasks validate PP-DPIN's superior performance and robustness against attacks compared to state-of-the-art methods.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wang et al. (2026) studied this question.

synapsesocial.com/papers/69b3ac6002a1e69014cce0bdhttps://doi.org/10.1109/tpami.2026.3672569
Ask AI
Helpful
Bookmark
Share
View Full Paper