Confederated Learning: Federated Learning With Decentralized Edge Servers

被引:18
作者
Wang, Bin [1 ,2 ]
Fang, Jun [1 ,2 ]
Li, Hongbin [3 ]
Yuan, Xiaojun [1 ,2 ]
Ling, Qing [4 ,5 ,6 ]
机构
[1] Univ Elect Sci & Technol China, Yangtze Delta Reg Inst Huzhou, Huzhou 313001, Peoples R China
[2] Univ Elect Sci & Technol China, Natl Key Lab Sci & Technol Commun, Chengdu 611731, Peoples R China
[3] Stevens Inst Technol, Dept Elect & Comp Engn, Hoboken, NJ 07030 USA
[4] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
[5] Sun Yat Sen Univ, Guangdong Prov Key Lab Computat Sci, Guangzhou 510006, Guangdong, Peoples R China
[6] Pazhou Lab, Guangzhou 510300, Guangdong, Peoples R China
基金
美国国家科学基金会;
关键词
Servers; Training; Peer-to-peer computing; Signal processing algorithms; Scalability; Data models; Computational modeling; Confederated learning; ADMM; random scheduling; CONVERGENCE;
D O I
10.1109/TSP.2023.3241768
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Federated learning (FL) is an emerging machine learning paradigm that allows to accomplish model training without aggregating data at a central server. Most studies on FL consider a centralized framework, in which a single server is endowed with a central authority to coordinate a number of devices to perform model training in an iterative manner. Due to stringent communication and bandwidth constraints, such a centralized framework has limited scalability as the number of devices grows. To address this issue, in this paper, we propose a ConFederated Learning (CFL) framework. The proposed CFL consists of multiple servers, in which each server is connected with an individual set of devices as in the conventional FL framework, and decentralized collaboration is leveraged among servers to make full use of the data dispersed throughout the network. We develop a stochastic alternating direction method of multipliers (ADMM) algorithm for CFL. The proposed algorithm employs a random scheduling policy which randomly selects a subset of devices to access their respective servers at each iteration, thus alleviating the need of uploading a huge amount of information from devices to servers. Theoretical analysis is presented to justify the proposed method. Numerical results show that the proposed method can converge to a decent solution significantly faster than gradient-based FL algorithms, thus boasting a substantial advantage in terms of communication efficiency.
引用
收藏
页码:248 / 263
页数:16
相关论文
共 41 条
[1]   Federated learning of predictive models from federated Electronic Health Records [J].
Brisimi, Theodora S. ;
Chen, Ruidi ;
Mela, Theofanie ;
Olshevsky, Alex ;
Paschalidis, Ioannis Ch. ;
Shi, Wei .
INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS, 2018, 112 :59-67
[2]  
Defazio A, 2014, ADV NEUR IN, V27
[3]  
Haddadpour F, 2019, ADV NEUR IN, V32
[4]  
Haddadpour F, 2019, Arxiv, DOI arXiv:1910.14425
[5]   ON THE O(1/n) CONVERGENCE RATE OF THE DOUGLAS-RACHFORD ALTERNATING DIRECTION METHOD [J].
He, Bingsheng ;
Yuan, Xiaoming .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2012, 50 (02) :700-709
[6]   Gossip Learning as a Decentralized Alternative to Federated Learning [J].
Hegedus, Istvan ;
Danner, Gabor ;
Jelasity, Mark .
DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS, DAIS 2019, 2019, 11534 :74-90
[7]  
Jiang Z., 2017, Advances in Neural Information Processing Systems, P5905
[8]  
Karimireddy SP, 2020, PR MACH LEARN RES, V119
[9]  
Koloskova A, 2019, PR MACH LEARN RES, V97
[10]  
Konecny J., 2016, P NIPS WORKSH PRIV M