An Incentive Mechanism for Cross-Silo Federated Learning: A Public Goods Perspective

被引:101
作者
Tang, Ming [1 ]
Wong, Vincent W. S. [1 ]
机构
[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC, Canada
来源
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021) | 2021年
关键词
Federated learning; incentive mechanism; game theory; public goods; resource allocation;
D O I
10.1109/INFOCOM42981.2021.9488705
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In cross-silo federated learning (FL), organizations cooperatively train a global model with their local data. The organizations, however, may be heterogeneous in terms of their valuation on the precision of the trained global model and their training cost. Meanwhile, the computational and communication resources of the organizations are non-excludable public goods. That is, even if an organization does not perform any local training, other organizations cannot prevent that organization from using the outcome of their resources (i.e., the trained global model). To address the organization heterogeneity and the public goods feature, in this paper, we formulate a social welfare maximization problem and propose an incentive mechanism for cross-silo FL. With the proposed mechanism, organizations can achieve not only social welfare maximization but also individual rationality and budget balance. Moreover, we propose a distributed algorithm that enables organizations to maximize the social welfare without knowing the valuation and cost of each other. Our simulations with MNIST dataset show that the proposed algorithm converges faster than a benchmark method. Furthermore, when organizations have higher valuation on precision, the proposed mechanism and algorithm are more beneficial in the sense that the organizations can achieve higher social welfare through participating in cross-silo FL.
引用
收藏
页数:10
相关论文
共 34 条
[1]   Federated Learning Over Wireless Fading Channels [J].
Amiri, Mohammad Mohammadi ;
Gunduz, Deniz .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (05) :3546-3557
[2]  
[Anonymous], Mnist database
[3]  
Balasubramanian N, 2009, IMC'09: PROCEEDINGS OF THE 2009 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P280
[4]  
Benzi M, 2005, ACTA NUMER, V14, P1, DOI 10.1017/S0962492904000212
[5]   An augmented Lagrangian method for distributed optimization [J].
Chatzipanagiotis, Nikolaos ;
Dentcheva, Darinka ;
Zavlanos, Michael M. .
MATHEMATICAL PROGRAMMING, 2015, 152 (1-2) :405-434
[6]  
Cornes RichardSandler., 1996, THEORY EXTERNALITIES, V2nd
[7]  
FeatureCloud, OUR VIS
[8]  
Hub E, ELECT PRICES CANADA
[9]   Advances and Open Problems in Federated Learning [J].
Kairouz, Peter ;
McMahan, H. Brendan ;
Avent, Brendan ;
Bellet, Aurelien ;
Bennis, Mehdi ;
Bhagoji, Arjun Nitin ;
Bonawitz, Kallista ;
Charles, Zachary ;
Cormode, Graham ;
Cummings, Rachel ;
D'Oliveira, Rafael G. L. ;
Eichner, Hubert ;
El Rouayheb, Salim ;
Evans, David ;
Gardner, Josh ;
Garrett, Zachary ;
Gascon, Adria ;
Ghazi, Badih ;
Gibbons, Phillip B. ;
Gruteser, Marco ;
Harchaoui, Zaid ;
He, Chaoyang ;
He, Lie ;
Huo, Zhouyuan ;
Hutchinson, Ben ;
Hsu, Justin ;
Jaggi, Martin ;
Javidi, Tara ;
Joshi, Gauri ;
Khodak, Mikhail ;
Konecny, Jakub ;
Korolova, Aleksandra ;
Koushanfar, Farinaz ;
Koyejo, Sanmi ;
Lepoint, Tancrede ;
Liu, Yang ;
Mittal, Prateek ;
Mohri, Mehryar ;
Nock, Richard ;
Ozgur, Ayfer ;
Pagh, Rasmus ;
Qi, Hang ;
Ramage, Daniel ;
Raskar, Ramesh ;
Raykova, Mariana ;
Song, Dawn ;
Song, Weikang ;
Stich, Sebastian U. ;
Sun, Ziteng ;
Suresh, Ananda Theertha .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2021, 14 (1-2) :1-210
[10]   An Efficient Game Form for Multi-Rate Multicast Service Provisioning [J].
Kakhbod, Ali ;
Teneketzis, Demosthenis .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2012, 30 (11) :2093-2104