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 条
  • [21] Asynchronous reconfiguration with Byzantine failures
    Petr Kuznetsov
    Andrei Tonkikh
    Distributed Computing, 2022, 35 : 477 - 502
  • [22] Asymmetric Asynchronous Byzantine Consensus
    Cachin, Christian
    Zanolini, Luca
    DATA PRIVACY MANAGEMENT, CRYPTOCURRENCIES AND BLOCKCHAIN TECHNOLOGY, ESORICS 2021, 2022, 13140 : 192 - 207
  • [23] ASYNCHRONOUS BYZANTINE AGREEMENT PROTOCOLS
    BRACHA, G
    INFORMATION AND COMPUTATION, 1987, 75 (02) : 130 - 143
  • [24] Byzantine-Resilient SGD in High Dimensions on Heterogeneous Data
    Data, Deepesh
    Diggavi, Suhas
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2310 - 2315
  • [25] Asynchronous Byzantine-Robust Stochastic Aggregation with Variance Reduction for Distributed Learning
    Zhu, Zehan
    Huang, Yan
    Zhao, Chengcheng
    Xu, Jinming
    2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 151 - 158
  • [26] Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?
    Guerraoui, Rachid
    Gupta, Nirupam
    Pinot, Rafael
    Rouault, Sebastien
    Stephan, John
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 391 - 401
  • [27] BLOCKING IN ASYNCHRONOUS, BUFFERED BANYAN NETWORKS
    HARRISON, PG
    PINTO, AD
    IFIP TRANSACTIONS C-COMMUNICATION SYSTEMS, 1992, 5 : 169 - 188
  • [28] VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS
    Pelc, Andrzej
    PARALLEL PROCESSING LETTERS, 2006, 16 (01) : 93 - 99
  • [29] Distributed Computability in Byzantine Asynchronous Systems
    Mendes, Hammurabi
    Tasson, Christine
    Herlihy, Maurice
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 704 - 713
  • [30] Asynchronous Byzantine Agreement with optimal resilience
    Arpita Patra
    Ashish Choudhury
    C. Pandu Rangan
    Distributed Computing, 2014, 27 : 111 - 146