The Value of Collaboration in Convex Machine Learning with Differential Privacy

被引:89
作者
Wu, Nan [1 ]
Farokhi, Farhad [2 ,3 ]
Smith, David [2 ,4 ]
Kaafar, Mohamed Ali [1 ,2 ]
机构
[1] Macquarie Univ, N Ryde, NSW, Australia
[2] CSIRO, Data61, Canberra, ACT, Australia
[3] Univ Melbourne, Melbourne, Vic 3010, Australia
[4] Australian Natl Univ, Canberra, ACT, Australia
来源
2020 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2020) | 2020年
关键词
Machine learning; Differential privacy; Stochastic gradient algorithm; REGRESSION;
D O I
10.1109/SP40000.2020.00025
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we apply machine learning to distributed private data owned by multiple data owners, entities with access to non-overlapping training datasets. We use noisy, differentially-private gradients to minimize the fitness cost of the machine learning model using stochastic gradient descent. We quantify the quality of the trained model, using the fitness cost, as a function of privacy budget and size of the distributed datasets to capture the trade-off between privacy and utility in machine learning. This way, we can predict the outcome of collaboration among privacy-aware data owners prior to executing potentially computationally-expensive machine learning algorithms. Particularly, we show that the difference between the fitness of the trained machine learning model using differentially-private gradient queries and the fitness of the trained machine model in the absence of any privacy concerns is inversely proportional to the size of the training datasets squared and the privacy budget squared. We successfully validate the performance prediction with the actual performance of the proposed privacy-aware learning algorithms, applied to: financial datasets for determining interest rates of loans using regression; and detecting credit card frauds using support vector machines.
引用
收藏
页码:304 / 317
页数:14
相关论文
共 34 条
[1]   Deep Learning with Differential Privacy [J].
Abadi, Martin ;
Chu, Andy ;
Goodfellow, Ian ;
McMahan, H. Brendan ;
Mironov, Ilya ;
Talwar, Kunal ;
Zhang, Li .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :308-318
[2]  
[Anonymous], 2020, Introductory lectures on convex optimization: A basic course, DOI DOI 10.1109/ACCESS.2020.2990567
[3]  
[Anonymous], 2018, ARXIV180810101
[4]  
[Anonymous], 2005, P 11 ACM SIGKDD INT, DOI DOI 10.1145/1081870.1081942
[5]   Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds [J].
Bassily, Raef ;
Smith, Adam ;
Thakurta, Abhradeep .
2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, :464-473
[6]   Revisiting the governance of privacy: Contemporary policy instruments in global perspective [J].
Bennett, Colin J. ;
Raab, Charles D. .
REGULATION & GOVERNANCE, 2020, 14 (03) :447-464
[7]   Practical Secure Aggregation for Privacy-Preserving Machine Learning [J].
Bonawitz, Keith ;
Ivanov, Vladimir ;
Kreuter, Ben ;
Marcedone, Antonio ;
McMahan, H. Brendan ;
Patel, Sarvar ;
Ramage, Daniel ;
Segal, Aaron ;
Seth, Karn .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1175-1191
[8]  
Chaudhuri A, 2009, PRODUCT RESEARCH: THE ART AND SCIENCE BEHIND SUCCESSFUL PRODUCT LAUNCHES, P289, DOI 10.1007/978-90-481-2860-0_16
[9]  
Dowlin N, 2016, PR MACH LEARN RES, V48
[10]  
Du WL, 2004, SIAM PROC S, P222