Not All Features Are Equal: Discovering Essential Features for Preserving Prediction Privacy

FatemehSadat Mireshghallah, Mohammadkazem Taram, A. Jalali, Ahmed T. Elthakeb, D. Tullsen, H. Esmaeilzadeh
{"title":"Not All Features Are Equal: Discovering Essential Features for Preserving Prediction Privacy","authors":"FatemehSadat Mireshghallah, Mohammadkazem Taram, A. Jalali, Ahmed T. Elthakeb, D. Tullsen, H. Esmaeilzadeh","doi":"10.1145/3442381.3449965","DOIUrl":null,"url":null,"abstract":"When receiving machine learning services from the cloud, the provider does not need to receive all features; in fact, only a subset of the features are necessary for the target prediction task. Discerning this subset is the key problem of this work. We formulate this problem as a gradient-based perturbation maximization method that discovers this subset in the input feature space with respect to the functionality of the prediction model used by the provider. After identifying the subset, our framework, Cloak, suppresses the rest of the features using utility-preserving constant values that are discovered through a separate gradient-based optimization process. We show that Cloak does not necessarily require collaboration from the service provider beyond its normal service, and can be applied in scenarios where we only have black-box access to the service provider’s model. We theoretically guarantee that Cloak’s optimizations reduce the upper bound of the Mutual Information (MI) between the data and the sifted representations that are sent out. Experimental results show that Cloak reduces the mutual information between the input and the sifted representations by 85.01% with only negligible reduction in utility (1.42%). In addition, we show that Cloak greatly diminishes adversaries’ ability to learn and infer non-conducive features.","PeriodicalId":106672,"journal":{"name":"Proceedings of the Web Conference 2021","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Web Conference 2021","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3442381.3449965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

When receiving machine learning services from the cloud, the provider does not need to receive all features; in fact, only a subset of the features are necessary for the target prediction task. Discerning this subset is the key problem of this work. We formulate this problem as a gradient-based perturbation maximization method that discovers this subset in the input feature space with respect to the functionality of the prediction model used by the provider. After identifying the subset, our framework, Cloak, suppresses the rest of the features using utility-preserving constant values that are discovered through a separate gradient-based optimization process. We show that Cloak does not necessarily require collaboration from the service provider beyond its normal service, and can be applied in scenarios where we only have black-box access to the service provider’s model. We theoretically guarantee that Cloak’s optimizations reduce the upper bound of the Mutual Information (MI) between the data and the sifted representations that are sent out. Experimental results show that Cloak reduces the mutual information between the input and the sifted representations by 85.01% with only negligible reduction in utility (1.42%). In addition, we show that Cloak greatly diminishes adversaries’ ability to learn and infer non-conducive features.
不是所有的特征都是平等的:发现保护预测隐私的基本特征
当从云端接收机器学习服务时,提供商不需要接收所有功能;事实上,目标预测任务只需要特征的一个子集。识别这个子集是这项工作的关键问题。我们将这个问题表述为基于梯度的扰动最大化方法,该方法在输入特征空间中根据提供者使用的预测模型的功能发现这个子集。在确定了子集之后,我们的框架Cloak使用通过单独的基于梯度的优化过程发现的保持效用的常数值来抑制其余的特征。我们表明,Cloak并不一定需要服务提供者在其正常服务之外进行协作,并且可以应用于我们只有黑盒访问服务提供者模型的场景中。从理论上讲,我们保证Cloak的优化减少了发送的数据和筛选后的表示之间的互信息(MI)的上限。实验结果表明,斗篷将输入和筛选表示之间的互信息减少了85.01%,而效用的降低可以忽略不计(1.42%)。此外,我们还表明,Cloak极大地削弱了对手学习和推断不利特征的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信