期刊文献+

非独立同分布数据下联邦学习的隐私保护算法 被引量:1

Privacy-preserving algorithms for federated learning under non-independent and non-identically distributed data
在线阅读 下载PDF
导出
摘要 针对联邦学习中客户端数据统计多样性以及隐私保护问题,提出一种基于差分隐私的联邦学习聚类模型循环交换算法(DPFed-CMRE)。通过聚类将数据分布类似的客户端分为一类,通过各类模型循环交换使全局模型适应客户端数据的不同分布,同时应用差分隐私技术保护客户端数据隐私,通过自适应梯度裁剪优化噪声分配,降低模型的性能损失。为验证算法的有效性,在3个标准数据集上进行大量实验,实验结果表明,提出算法提升了联邦学习在客户端数据高度非独立同分布(Non-IID)以及高隐私保证情况下的性能。 In response to the issues of client data diversity and privacy protection in federated learning,a federated learning clustering model with a differential privacy-based cyclic model rotation algorithm(DPFed-CMRE)was proposed.Clients with similar data distributions were clustered into groups and models among these groups were cyclically exchanged to adapt the global model to the different data distributions of clients.Differential privacy techniques were applied to protect client data privacy.Adaptive gradient clipping was used to optimize noise allocation,reducing the performance loss of the model.To validate the effectiveness of the algorithm,extensive experiments were conducted on three standard datasets.Result of experiments show that the proposed method enhances the performance of federated learning in situations where client data is highly non-independent and iden-tically distributed(Non-IID)and under high privacy guarantees.
作者 张愈杰 龙士工 张珺铭 刘光源 ZHANG Yu-jie;LONG Shi-gong;ZHANG Jun-ming;LIU Guang-yuan(State Key Laboratory of Public Big Data,Guizhou University,Guiyang 550025,China;School of Computer Science and Technology,Guizhou University,Guiyang 550025,China;School of Computer Science and Technology,Guizhou Polytechnic of Construction,Guiyang 551400,China)
出处 《计算机工程与设计》 北大核心 2025年第4期1047-1055,共9页 Computer Engineering and Design
基金 国家自然科学基金项目(62062020)。
关键词 联邦学习 差分隐私 自适应 非独立同分布 聚类 梯度裁剪 隐私保护 federation learning differential privacy adaptive non-independent and non-identically distributed cluster gradient clipping privacy protection
  • 相关文献

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部