Boosting Accuracy of Differentially Private Continuous Data Release for Federated Learning

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Information Forensics and Security Pub Date : 2024-10-09 DOI:10.1109/TIFS.2024.3477325
Jianping Cai;Qingqing Ye;Haibo Hu;Ximeng Liu;Yanggeng Fu
{"title":"Boosting Accuracy of Differentially Private Continuous Data Release for Federated Learning","authors":"Jianping Cai;Qingqing Ye;Haibo Hu;Ximeng Liu;Yanggeng Fu","doi":"10.1109/TIFS.2024.3477325","DOIUrl":null,"url":null,"abstract":"Incorporating differentially private continuous data release (DPCR) into private federated learning (FL) has recently emerged as a powerful technique for enhancing accuracy. Designing an effective DPCR model is the key to improving accuracy. Still, the state-of-the-art DPCR models hinder the potential for accuracy improvement due to insufficient privacy budget allocation and the design only for specific iteration numbers. To boost accuracy further, we develop an augmented BIT-based continuous data release (AuBCR) model, leading to demonstrable accuracy enhancements. By employing a dual-release strategy, AuBCR gains the potential to further improve accuracy, while confronting the challenge of consistent release and doubly-nested complex privacy budget allocation problem. Against this, we design an efficient optimal consistent estimation algorithm with only \n<inline-formula> <tex-math>$O(1)$ </tex-math></inline-formula>\n complexity per release. Subsequently, we introduce the \n<inline-formula> <tex-math>$(k, N)$ </tex-math></inline-formula>\n-AuBCR Model concept and design a meta-factor method. This innovation significantly reduces the optimization variables from \n<inline-formula> <tex-math>$O(T)$ </tex-math></inline-formula>\n to \n<inline-formula> <tex-math>$O\\left ({{lg^{2} T}}\\right)$ </tex-math></inline-formula>\n, thereby greatly enhancing the solvability of optimal privacy budget allocation and simultaneously supporting arbitrary iteration number T. Our experiments on classical datasets show that AuBCR boosts accuracy by 4.9% ~ 18.1% compared to traditional private FL and 0.4% ~ 1.2% compared to the state-of-the-art ABCRG model.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"19 ","pages":"10287-10301"},"PeriodicalIF":6.3000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10711967/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Incorporating differentially private continuous data release (DPCR) into private federated learning (FL) has recently emerged as a powerful technique for enhancing accuracy. Designing an effective DPCR model is the key to improving accuracy. Still, the state-of-the-art DPCR models hinder the potential for accuracy improvement due to insufficient privacy budget allocation and the design only for specific iteration numbers. To boost accuracy further, we develop an augmented BIT-based continuous data release (AuBCR) model, leading to demonstrable accuracy enhancements. By employing a dual-release strategy, AuBCR gains the potential to further improve accuracy, while confronting the challenge of consistent release and doubly-nested complex privacy budget allocation problem. Against this, we design an efficient optimal consistent estimation algorithm with only $O(1)$ complexity per release. Subsequently, we introduce the $(k, N)$ -AuBCR Model concept and design a meta-factor method. This innovation significantly reduces the optimization variables from $O(T)$ to $O\left ({{lg^{2} T}}\right)$ , thereby greatly enhancing the solvability of optimal privacy budget allocation and simultaneously supporting arbitrary iteration number T. Our experiments on classical datasets show that AuBCR boosts accuracy by 4.9% ~ 18.1% compared to traditional private FL and 0.4% ~ 1.2% compared to the state-of-the-art ABCRG model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为联合学习提高差异化私有连续数据发布的准确性
将差异化私有连续数据发布(DPCR)纳入私有联合学习(FL)是最近出现的一种提高准确性的强大技术。设计有效的 DPCR 模型是提高准确率的关键。然而,最先进的 DPCR 模型由于隐私预算分配不足以及仅针对特定迭代次数进行设计,阻碍了提高准确率的潜力。为了进一步提高准确性,我们开发了基于 BIT 的增强型连续数据释放(AuBCR)模型,从而显著提高了准确性。通过采用双重发布策略,AuBCR 有可能进一步提高准确性,同时还能应对一致发布和双重嵌套复杂隐私预算分配问题的挑战。为此,我们设计了一种高效的最优一致估计算法,每次释放的复杂度仅为 $O(1)$。随后,我们引入了 $(k, N)$ -AuBCR 模型概念,并设计了一种元因子方法。这一创新将优化变量从$O(T)$大幅减少到$O({{lg^{2} T}}\right)$,从而大大提高了最优隐私预算分配的可解性,并同时支持任意迭代次数T。我们在经典数据集上的实验表明,与传统的私有FL相比,AuBCR的准确率提高了4.9% ~ 18.1%,与最先进的ABCRG模型相比,提高了0.4% ~ 1.2%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
期刊最新文献
Attackers Are Not the Same! Unveiling the Impact of Feature Distribution on Label Inference Attacks Backdoor Online Tracing With Evolving Graphs LHADRO: A Robust Control Framework for Autonomous Vehicles Under Cyber-Physical Attacks Towards Mobile Palmprint Recognition via Multi-view Hierarchical Graph Learning Succinct Hash-based Arbitrary-Range Proofs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1