提出DPDL算法,在非独立同分布数据下实现去中心化学习的差分隐私保护。
DPDL: Towards Differential Privacy Preservation in Decentralized Stochastic Learning on Non-IID Data
- 通过相似性校准与高斯噪声扰动跨梯度,保护隐私
- 在非独立同分布数据下仍保持线性训练加速
- 适合注重隐私安全的分布式机器学习场景
在去中心化学习中,多个智能体协作训练全局模型,但需频繁交换梯度信息,易导致隐私泄露。尤其在真实场景中,各智能体的数据分布通常非独立同分布(non-IID),进一步加剧隐私风险。为此,本文提出隐私保护型去中心化学习算法DPDL,利用差分隐私(DP)思想,在跨梯度聚合中引入基于相似性的校准机制。每轮中,各智能体对邻居本地模型在自身数据上的梯度(即跨梯度)添加高斯噪声后共享;接收后,采用余弦相似度校准扰动后的跨梯度,以实现类似动量的本地模型更新。理论分析表明,该方法在保证特定隐私水平时所需的最小噪声水平,并证明其在非独立同分布数据下仍具备线性训练加速能力。大量实验验证了该算法在防御隐私攻击和训练高精度模型方面的有效性。
原文摘要 · Abstract (English)
In the paradigm of decentralized learning, a group of agents collaborate to train a global model using distributed datasets without a central server. Although the power of collaboration has been verified by many state-of-the-art studies, it entails extensive gradient information exchanging among the agents and thus induces high risk of privacy leakage for the individual agents. Moreover, in real-world applications, the training data are usually non-identically and independently distributed across the agents, inducing more challenges to enable privacy-preserved decentralized learning. To address these issues, we propose a privacy-preserved decentralized learning algorithm with non-IID data, DPDL, which leverages the notion of Differential Privacy (DP) in cross-gradient aggregation through a similarity-based calibration technique. Specifically, in each round, each agent perturbs the cross-gradients (i.e., the derivatives of its neighbors' local model in its private local data) by Gaussian noise mechanism before sharing them with its neighbors; it then adopt cosine similarity to calibrate the received perturbed cross-gradients such that the aggregation of the calibrated cross-gradients can be utilized to effectively update local model in a momentum-like manner. Our rigorous theoretical analysis not only reveals the minimum noise level required to achieve a specific level of privacy preservation, but also illustrates that our algorithm still achieves a linear speedup in training with non-IID data. We finally conduct extensive experiments on real-world dataset to validate the effectiveness of our algorithm in defending privacy attacks and in training accurate models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。