Incentive Mechanism for Differentially Private Federated Learning in Industrial Internet of Things

被引:21
作者
Xu, Yin [1 ]
Xiao, Mingjun [1 ]
Tan, Haisheng [2 ,3 ]
Liu, An [4 ]
Gao, Guoju [4 ]
Yan, Zhaoyang [5 ]
机构
[1] Univ Sci & Technol China, Suzhou Inst Adv Res, Sch Comp Sci & Technol, Hefei 230026, Peoples R China
[2] Univ Sci & Technol China, LINKE Lab, Hefei 230026, Peoples R China
[3] Univ Sci & Technol China, CAS Key Lab Wireless Opt Commun, Hefei 230026, Peoples R China
[4] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Peoples R China
[5] Lehigh Univ, PC Rossin Coll Engn & Appl Sci, Bethlehem, PA 18015 USA
基金
中国国家自然科学基金;
关键词
Privacy; Servers; Data models; Training; Industrial Internet of Things; Games; Computational modeling; Federated learning; industrial Internet of Things (IoT); privacy preservation; Stackelberg game; DESIGN;
D O I
10.1109/TII.2021.3134257
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning (FL) is a newly emerging distributed machine learning paradigm, whereby a server can coordinate multiple clients to jointly train a learning model by using their private datasets. Many researches focus on designing incentive mechanisms in FL, but most of them cannot allow that clients flexibly determine privacy budgets by themselves. In this article, we propose a privacy-preserving incentive mechanism (NICE) based on differential privacy (DP) and Stackelberg game for FL systems in industrial Internet of Things. First, we design a flexible privacy-preserving mechanism for NICE, in which clients can add a Laplace noise into the loss function according to a customized privacy budget. Under this mechanism, we design two incentive utility functions for the server and clients. Next, we model the utility optimization problems as a two-stage Stackelberg game by seeing the server as a leader and the clients as followers. Finally, we derive an optimal Stackelberg equilibrium solution for both the stages of the whole game. Based on this solution, NICE can make the server and all clients achieve their maximum utilities simultaneously. In addition, we conduct extensive simulations on real-world datasets to demonstrate the significant performance of the proposed mechanism.
引用
收藏
页码:6927 / 6939
页数:13
相关论文
共 41 条
[1]  
Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
[2]  
[Anonymous], 1964, Principles of Mathematical Analysis
[3]   Deep Reinforcement Learning for Demand Response in Distribution Networks [J].
Bahrami, Shahab ;
Chen, Yu Christine ;
Wong, Vincent W. S. .
IEEE TRANSACTIONS ON SMART GRID, 2021, 12 (02) :1496-1506
[4]  
Bhowmick A, 2019, Arxiv, DOI arXiv:1812.00984
[5]  
Dinh C. T., 2020, PROC ACM INT C PROC, P1
[6]   Calibrating noise to sensitivity in private data analysis [J].
Dwork, Cynthia ;
McSherry, Frank ;
Nissim, Kobbi ;
Smith, Adam .
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 :265-284
[7]   Selling privacy at auction [J].
Ghosh, Arpita ;
Roth, Aaron .
GAMES AND ECONOMIC BEHAVIOR, 2015, 91 :334-346
[8]  
Jayaraman B, 2018, ADV NEUR IN, V31
[9]   Toward an Automated Auction Framework for Wireless Federated Learning Services Market [J].
Jiao, Yutao ;
Wang, Ping ;
Niyato, Dusit ;
Lin, Bin ;
Kim, Dong In .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (10) :3034-3048
[10]   Incentive Mechanism for Reliable Federated Learning: A Joint Optimization Approach to Combining Reputation and Contract Theory [J].
Kang, Jiawen ;
Xiong, Zehui ;
Niyato, Dusit ;
Xie, Shengli ;
Zhang, Junshan .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (06) :10700-10714