Brief Announcement: Byzantine-Tolerant Machine Learning

被引:2
|
作者
Blanchard, Peva [1 ]
El Mhamdi, El Mahdi [1 ]
Guerraoui, Rachid [1 ]
Stainer, Julien [1 ]
机构
[1] Swiss Fed Inst Technol, Lausanne, Switzerland
基金
瑞士国家科学基金会;
关键词
Distributed Stochastic Gradient Descent; Adversarial Machine Learning;
D O I
10.1145/3087801.3087861
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We report on Krum, the first provably Byzantine-tolerant aggregation rule for distributed Stochastic Gradient Descent (SGD). Krum guarantees the convergence of SGD even in a distributed setting where (asymptotically) up to half of the workers can be malicious adversaries trying to attack the learning system.
引用
收藏
页码:455 / 457
页数:3
相关论文
共 50 条
  • [31] Byzantine-tolerant uniform node sampling service in large-scale networks
    Anceaume, Emmanuelle
    Busnel, Yann
    Sericola, Bruno
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2021, 36 (05) : 412 - 439
  • [32] RAPTEE: Leveraging trusted execution environments for Byzantine-tolerant peer sampling services
    Pigaglio, Matthieu
    Bruneau-Queyreix, Joachim
    Bromberg, Yerom-David
    Frey, Davide
    Riviere, Etienne
    Reveillere, Laurent
    2022 IEEE 42ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2022), 2022, : 603 - 613
  • [33] Brief Announcement: Accurate Byzantine Agreement with Feedback
    Garg, Vijay K.
    Bridgman, John
    Balasubramanian, Bharath
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 215 - 216
  • [34] Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
    Bonomi, Silvia
    Del Pozzo, Antonella
    Potop-Butucaru, Maria
    THEORETICAL COMPUTER SCIENCE, 2018, 709 : 64 - 79
  • [35] Partition-Tolerant and Byzantine-Tolerant Decision Making for Distributed Robotic Systems With IOTA and ROS2
    Keramat, Farhad
    Queralta, Jorge Pena
    Westerlund, Tomi
    IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (14) : 12985 - 12998
  • [36] Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems
    Kshemkalyani, Ajay D.
    Misra, Anshuman
    ALGORITHMS, 2025, 18 (01)
  • [37] Semi-Fast Byzantine-tolerant Shared Register without Reliable Broadcast
    Konwar, Kishori M.
    Kumar, Saptaparni
    Tseng, Lewis
    2020 IEEE 40TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2020, : 743 - 753
  • [38] A Byzantine-Tolerant Distributed Consensus Algorithm for Connected Vehicles Using Proof-of-Eligibility
    Liu, Huiye
    Lin, Chung-Wei
    Kang, Eunsuk
    Shiraishi, Shinichi
    Blough, Douglas M.
    MSWIM'19: PROCEEDINGS OF THE 22ND INTERNATIONAL ACM CONFERENCE ON MODELING, ANALYSIS AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS, 2019, : 225 - 234
  • [39] Real-time, Byzantine-tolerant information dissemination in unreliable and untrustworthy distributed systems
    Han, Kai
    Pei, Guanhong
    Ravindran, Binoy
    Jensen, E. D.
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 1727 - +
  • [40] Brief Announcement: Communication Efficient Asynchronous Byzantine Agreement
    Patra, Arpita
    Rangan, C. Pandu
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 243 - 244