Skellam mixture mechanism

Author:

Bao Ergute1,Zhu Yizheng1,Xiao Xiaokui1,Yang Yin2,Ooi Beng Chin1,Tan Benjamin Hong Meng3,Aung Khin Mi Mi3

Affiliation:

1. National University of Singapore

2. Hamad Bin Khalifa University

3. A*STAR, Singapore

Abstract

Deep neural networks have strong capabilities of memorizing the underlying training data, which can be a serious privacy concern. An effective solution to this problem is to train models with differential privacy ( DP ), which provides rigorous privacy guarantees by injecting random noise to the gradients. This paper focuses on the scenario where sensitive data are distributed among multiple participants, who jointly train a model through federated learning , using both secure multiparty computation ( MPC ) to ensure the confidentiality of each gradient update, and differential privacy to avoid data leakage in the resulting model. A major challenge in this setting is that common mechanisms for enforcing DP in deep learning, which inject real-valued noise , are fundamentally incompatible with MPC, which exchanges finite-field integers among the participants. Consequently, most existing DP mechanisms require rather high noise levels, leading to poor model utility. Motivated by this, we propose Skellam mixture mechanism (SMM), a novel approach to enforcing DP on models built via federated learning. Compared to existing methods, SMM eliminates the assumption that the input gradients must be integer-valued, and, thus, reduces the amount of noise injected to preserve DP. The theoretical analysis of SMM is highly non-trivial, especially considering (i) the complicated math of DP deep learning in general and (ii) the fact that the mixture of two Skellam distributions is rather complex. Extensive experiments on various practical settings demonstrate that SMM consistently and significantly outperforms existing solutions in terms of the utility of the resulting model.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference53 articles.

1. Martín Abadi Paul Barham Jianmin Chen Zhifeng Chen Andy Davis Jeffrey Dean Matthieu Devin Sanjay Ghemawat Geoffrey Irving Michael Isard Manjunath Kudlur Josh Levenberg Rajat Monga Sherry Moore Derek G. Murray Benoit Steiner Paul Tucker Vijay Vasudevan Pete Warden Martin Wicke Yuan Yu and Xiaoqiang Zheng. 2016. TensorFlow: A System for Large-Scale Machine Learning. In OSDI. 265--283. Martín Abadi Paul Barham Jianmin Chen Zhifeng Chen Andy Davis Jeffrey Dean Matthieu Devin Sanjay Ghemawat Geoffrey Irving Michael Isard Manjunath Kudlur Josh Levenberg Rajat Monga Sherry Moore Derek G. Murray Benoit Steiner Paul Tucker Vijay Vasudevan Pete Warden Martin Wicke Yuan Yu and Xiaoqiang Zheng. 2016. TensorFlow: A System for Large-Scale Machine Learning. In OSDI. 265--283.

2. Martín Abadi Andy Chu Ian J. Goodfellow H. Brendan McMahan Ilya Mironov Kunal Talwar and Li Zhang. 2016. Deep Learning with Differential Privacy. In CCS. 308--318. Martín Abadi Andy Chu Ian J. Goodfellow H. Brendan McMahan Ilya Mironov Kunal Talwar and Li Zhang. 2016. Deep Learning with Differential Privacy. In CCS. 308--318.

3. Naman Agarwal Peter Kairouz and Ziyu Liu. 2021. The Skellam Mechanism for Differentially Private Federated Learning. In NeurIPS. 5052--5064. Naman Agarwal Peter Kairouz and Ziyu Liu. 2021. The Skellam Mechanism for Differentially Private Federated Learning. In NeurIPS. 5052--5064.

4. Naman Agarwal , Ananda Theertha Suresh , Felix Yu, Sanjiv Kumar, and H. Brendan McMahan. 2018 . CpSGD: Communication- Efficient and Differentially-Private Distributed SGD. In NeurIPS. 7575--7586. Naman Agarwal, Ananda Theertha Suresh, Felix Yu, Sanjiv Kumar, and H. Brendan McMahan. 2018. CpSGD: Communication-Efficient and Differentially-Private Distributed SGD. In NeurIPS. 7575--7586.

5. Prabhanjan Ananth , Arka Rai Choudhuri , Aarushi Goel, and Abhishek Jain. 2018 . Round-Optimal Secure Multiparty Computation with Honest Majority. In CRYPTO. 395--424. Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, and Abhishek Jain. 2018. Round-Optimal Secure Multiparty Computation with Honest Majority. In CRYPTO. 395--424.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. DProvDB: Differentially Private Query Processing with Multi-Analyst Provenance;Proceedings of the ACM on Management of Data;2023-12-08

2. FedCSS: Joint Client-and-Sample Selection for Hard Sample-Aware Noise-Robust Federated Learning;Proceedings of the ACM on Management of Data;2023-11-13

3. Trusted AI in Multiagent Systems: An Overview of Privacy and Security for Distributed Learning;Proceedings of the IEEE;2023-09

4. ShapleyFL: Robust Federated Learning Based on Shapley Value;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

5. Incentive-Aware Decentralized Data Collaboration;Proceedings of the ACM on Management of Data;2023-06-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3