DP-SGD-global-adapt-V2-S: Triad improvements of privacy, accuracy and fairness via step decay noise multiplier and step decay upper clipping threshold

IF 5.9 3区 管理学 Q1 BUSINESS
Sai Venkatesh Chilukoti , Md Imran Hossen , Liqun Shan , Vijay Srinivas Tida , Mahathir Mohammad Bappy , Wenmeng Tian , Xiali Hei
{"title":"DP-SGD-global-adapt-V2-S: Triad improvements of privacy, accuracy and fairness via step decay noise multiplier and step decay upper clipping threshold","authors":"Sai Venkatesh Chilukoti ,&nbsp;Md Imran Hossen ,&nbsp;Liqun Shan ,&nbsp;Vijay Srinivas Tida ,&nbsp;Mahathir Mohammad Bappy ,&nbsp;Wenmeng Tian ,&nbsp;Xiali Hei","doi":"10.1016/j.elerap.2025.101476","DOIUrl":null,"url":null,"abstract":"<div><div>Differentially Private Stochastic Gradient Descent (DP-SGD) has become a widely used technique for safeguarding sensitive information in deep learning applications. Unfortunately, DP-SGD’s per-sample gradient clipping and uniform noise addition during training can significantly degrade model utility and fairness. We observe that the latest DP-SGD-Global-Adapt’s average gradient norm is the same throughout the training. Even when it is integrated with the existing linear decay noise multiplier, it has little or no advantage. Moreover, we notice that its upper clipping threshold increases exponentially towards the end of training, potentially impacting the model’s convergence. Other algorithms, DP-PSAC, Auto-S, DP-SGD-Global, and DP-F, have utility and fairness that are similar to or worse than DP-SGD, as demonstrated in experiments. To overcome these problems and improve utility and fairness, we developed the DP-SGD-Global-Adapt-V2-S. It has a step-decay noise multiplier and an upper clipping threshold that is also decayed step-wise. DP-SGD-Global-Adapt-V2-S with a privacy budget (<span><math><mi>ϵ</mi></math></span>) of 1 improves accuracy by 0.9795%, 0.6786%, and 4.0130% in MNIST, CIFAR10, and CIFAR100, respectively. It also reduces the privacy cost gap (<span><math><mi>π</mi></math></span>) by 89.8332% and 60.5541% in unbalanced MNIST and Thinwall datasets, respectively. Finally, we develop mathematical expressions to compute the privacy budget using truncated concentrated differential privacy (tCDP) for DP-SGD-Global-Adapt-V2-T and DP-SGD-Global-Adapt-V2-S.</div></div>","PeriodicalId":50541,"journal":{"name":"Electronic Commerce Research and Applications","volume":"70 ","pages":"Article 101476"},"PeriodicalIF":5.9000,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Commerce Research and Applications","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1567422325000018","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS","Score":null,"Total":0}
引用次数: 0

Abstract

Differentially Private Stochastic Gradient Descent (DP-SGD) has become a widely used technique for safeguarding sensitive information in deep learning applications. Unfortunately, DP-SGD’s per-sample gradient clipping and uniform noise addition during training can significantly degrade model utility and fairness. We observe that the latest DP-SGD-Global-Adapt’s average gradient norm is the same throughout the training. Even when it is integrated with the existing linear decay noise multiplier, it has little or no advantage. Moreover, we notice that its upper clipping threshold increases exponentially towards the end of training, potentially impacting the model’s convergence. Other algorithms, DP-PSAC, Auto-S, DP-SGD-Global, and DP-F, have utility and fairness that are similar to or worse than DP-SGD, as demonstrated in experiments. To overcome these problems and improve utility and fairness, we developed the DP-SGD-Global-Adapt-V2-S. It has a step-decay noise multiplier and an upper clipping threshold that is also decayed step-wise. DP-SGD-Global-Adapt-V2-S with a privacy budget (ϵ) of 1 improves accuracy by 0.9795%, 0.6786%, and 4.0130% in MNIST, CIFAR10, and CIFAR100, respectively. It also reduces the privacy cost gap (π) by 89.8332% and 60.5541% in unbalanced MNIST and Thinwall datasets, respectively. Finally, we develop mathematical expressions to compute the privacy budget using truncated concentrated differential privacy (tCDP) for DP-SGD-Global-Adapt-V2-T and DP-SGD-Global-Adapt-V2-S.
dp - sgd -global- adaptive - v2 - s:通过阶跃衰减噪声乘法器和阶跃衰减截波上限阈值对保密性、准确性和公平性进行三重改进
差分私有随机梯度下降算法(differential Private Stochastic Gradient Descent, DP-SGD)已成为深度学习应用中广泛使用的敏感信息保护技术。不幸的是,DP-SGD的每样本梯度裁剪和训练过程中的均匀噪声添加会显著降低模型的效用和公平性。我们观察到最新的DP-SGD-Global-Adapt的平均梯度范数在整个训练过程中是相同的。即使与现有的线性衰减噪声乘法器集成,它也几乎没有优势。此外,我们注意到它的上限裁剪阈值在训练结束时呈指数增长,这可能会影响模型的收敛性。实验证明,DP-PSAC、Auto-S、DP-SGD- global和DP-F等算法的效用和公平性与DP-SGD相似,甚至不如DP-SGD。为了克服这些问题,提高效用和公平性,我们开发了DP-SGD-Global-Adapt-V2-S。它具有阶跃衰减噪声乘法器和阶跃衰减的上削波阈值。隐私预算(ε)为1的DP-SGD-Global-Adapt-V2-S在MNIST、CIFAR10和CIFAR100中分别提高了0.9795%、0.6786%和4.0130%的准确率。在非平衡的MNIST和Thinwall数据集上,该算法还将隐私成本差距(π)分别降低了89.8332%和60.5541%。最后,我们建立了DP-SGD-Global-Adapt-V2-T和DP-SGD-Global-Adapt-V2-S使用截断集中差分隐私(tCDP)计算隐私预算的数学表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Electronic Commerce Research and Applications
Electronic Commerce Research and Applications 工程技术-计算机:跨学科应用
CiteScore
10.10
自引率
8.30%
发文量
97
审稿时长
63 days
期刊介绍: Electronic Commerce Research and Applications aims to create and disseminate enduring knowledge for the fast-changing e-commerce environment. A major dilemma in e-commerce research is how to achieve a balance between the currency and the life span of knowledge. Electronic Commerce Research and Applications will contribute to the establishment of a research community to create the knowledge, technology, theory, and applications for the development of electronic commerce. This is targeted at the intersection of technological potential and business aims.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信