Gossip Learning as a Decentralized Alternative to Federated Learning

被引:128
作者
Hegedus, Istvan [1 ]
Danner, Gabor [1 ]
Jelasity, Mark [1 ,2 ]
机构
[1] Univ Szeged, Szeged, Hungary
[2] MTA SZTE Res Grp Artificial Intelligence, Szeged, Hungary
来源
DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS, DAIS 2019 | 2019年 / 11534卷
关键词
D O I
10.1007/978-3-030-22496-7_5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Federated learning is a distributed machine learning approach for computing models over data collected by edge devices. Most importantly, the data itself is not collected centrally, but a master-worker architecture is applied where a master node performs aggregation and the edge devices are the workers, not unlike the parameter server approach. Gossip learning also assumes that the data remains at the edge devices, but it requires no aggregation server or any central component. In this empirical study, we present a thorough comparison of the two approaches. We examine the aggregated cost of machine learning in both cases, considering also a compression technique applicable in both approaches. We apply a real churn trace as well collected over mobile phones, and we also experiment with different distributions of the training data over the devices. Surprisingly, gossip learning actually outperforms federated learning in all the scenarios where the training data are distributed uniformly over the nodes, and it performs comparably to federated learning overall.
引用
收藏
页码:74 / 90
页数:17
相关论文
共 15 条
[1]  
Anguita D., 2013, ESANN, V3, P3
[2]  
Berta A, 2014, IEEE INT CONF PEER
[3]  
Bonawitz K., 2016, NIPS WORKSH PRIV MUL
[4]  
Danner G., 2018, SECUR COMMUN NETW, V2018, P15
[5]   Robust Decentralized Mean Estimation with Limited Communication [J].
Danner, Gabor ;
Jelasity, Mark .
EURO-PAR 2018: PARALLEL PROCESSING, 2018, 11014 :447-461
[6]   Token Account Algorithms: The Best of the Proactive and Reactive Worlds [J].
Danner, Gabor ;
Jelasity, Mark .
2018 IEEE 38TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2018, :885-895
[7]  
Dean J., 2012, P ADV NEUR INF PROC, V25, P1223
[8]   Robust Decentralized Low-Rank Matrix Decomposition [J].
Hegedus, Istvan ;
Berta, Arpad ;
Kocsis, Levente ;
Benczur, Andras A. ;
Jelasity, Mark .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2016, 7 (04)
[9]   Gossip-based peer sampling [J].
Jelasity, Mark ;
Voulgaris, Spyros ;
Guerraoui, Rachid ;
Kermarrec, Anne-Marie ;
Van Steen, Maarten .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2007, 25 (03)
[10]  
Konecny J., 2016, PRIVATE MULTIPARTY M