BASGD: Buffered Asynchronous SGD for Byzantine Learning

被引:0
|
作者
Yang, Yi-Rui [1 ]
Li, Wu-Jun [1 ]
机构
[1] Nanjing Univ, Dept Comp Sci & Technol, Natl Key Lab Novel Software Technol, Nanjing, Peoples R China
基金
国家重点研发计划;
关键词
PARALLEL;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Distributed learning has become a hot research topic due to its wide application in cluster-based large-scale learning, federated learning, edge computing and so on. Most traditional distributed learning methods typically assume no failure or attack. However, many unexpected cases, such as communication failure and even malicious attack, may happen in real applications. Hence, Byzantine learning (BL), which refers to distributed learning with failure or attack, has recently attracted much attention. Most existing BL methods are synchronous, which are impractical in some applications due to heterogeneous or offline workers. In these cases, asynchronous BL (ABL) is usually preferred. In this paper, we propose a novel method, called buffered asynchronous stochastic gradient descent (BASGD), for ABL. To the best of our knowledge, BASGD is the first ABL method that can resist malicious attack without storing any instances on server. Compared with those methods which need to store instances on server, BASGD has a wider scope of application. BASGD is proved to be convergent, and be able to resist failure or attack. Empirical results show that BASGD significantly outperforms vanilla asynchronous stochastic gradient descent (ASGD) and other ABL baselines when there exists failure or attack on workers.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] Access cost for asynchronous Byzantine quorum systems
    Rida A. Bazzi
    Distributed Computing, 2001, 14 : 41 - 48
  • [42] Multidimensional Approximate Agreement in Byzantine Asynchronous Systems
    Mendes, Hammurabi
    Herlihy, Maurice
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 391 - 400
  • [43] Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation
    Xie, Cong
    Koyejo, Oluwasanmi
    Gupta, Indranil
    35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), 2020, 115 : 261 - 270
  • [44] Asymptotically Optimal Validated Asynchronous Byzantine Agreement
    Abraham, Ittai
    Malkhi, Dahlia
    Spiegelman, Alexander
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 337 - 346
  • [45] Atomic Appends in Asynchronous Byzantine Distributed Ledgers
    Cholvi, Vicent
    Fernandez Anta, Antonio
    Georgiou, Chryssis
    Nicolaou, Nicolas
    Raynal, Michel
    2020 16TH EUROPEAN DEPENDABLE COMPUTING CONFERENCE (EDCC 2020), 2020, : 77 - 84
  • [46] Asynchronous Byzantine reliable broadcast with a message adversary
    Albouy, Timothe
    Frey, Davide
    Raynal, Michel
    Taiani, Francois
    THEORETICAL COMPUTER SCIENCE, 2023, 978
  • [47] Chronos: An Efficient Asynchronous Byzantine Ordered Consensus
    Zhang, Zongyang
    Zhang, Lingyue
    Wang, Zhuo
    Li, Yichen
    Lu, Rongxing
    Yu, Yong
    COMPUTER JOURNAL, 2023, 67 (03): : 1153 - 1162
  • [48] Limiting Byzantine Influence in Multihop Asynchronous Networks
    Maurer, Alexandre
    Tixeuil, Sebastien
    2012 IEEE 32ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2012, : 183 - 192
  • [49] Self-stabilizing byzantine asynchronous unison
    Dubois, Swan
    Potop-Butucaru, Maria
    Nesterenko, Mikhail
    Tixeuil, Sebastien
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (07) : 917 - 923
  • [50] Atomic Appends in Asynchronous Byzantine Distributed Ledgers
    Cholvi, Vicent
    Anta, Antonio Fernandez
    Georgiou, Chryssis
    Nicolaou, Nicolas
    Raynal, Michel
    Russo, Antonio
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2023, 182