English
Related papers

Related papers: Bounding the Impact of Unbounded Attacks in Stabil…

200 papers

In this paper, we propose a class of robust stochastic subgradient methods for distributed learning from heterogeneous datasets at presence of an unknown number of Byzantine workers. The Byzantine workers, during the learning process, may…

Machine Learning · Computer Science 2019-11-12 Liping Li , Wei Xu , Tianyi Chen , Georgios B. Giannakis , Qing Ling

We study a recently proposed large-scale distributed learning paradigm, namely Federated Learning, where the worker machines are end users' own devices. Statistical and computational challenges arise in Federated Learning particularly in…

Machine Learning · Computer Science 2019-10-11 Avishek Ghosh , Justin Hong , Dong Yin , Kannan Ramchandran

In Federated Reinforcement Learning (FRL), agents aim to collaboratively learn a common task, while each agent is acting in its local environment without exchanging raw trajectories. Existing approaches for FRL either (a) do not provide any…

Machine Learning · Computer Science 2024-01-09 Philip Jordan , Florian Grötschla , Flint Xiaofeng Fan , Roger Wattenhofer

Byzantine robustness is an essential feature of algorithms for certain distributed optimization problems, typically encountered in collaborative/federated learning. These problems are usually huge-scale, implying that communication…

Optimization and Control · Mathematics 2024-03-12 Ahmad Rammal , Kaja Gruntkowska , Nikita Fedin , Eduard Gorbunov , Peter Richtárik

Communication between workers and the master node to collect local stochastic gradients is a key bottleneck in a large-scale federated learning system. Various recent works have proposed to compress the local stochastic gradients to…

Machine Learning · Computer Science 2024-02-06 Heng Zhu , Qing Ling

Federated Learning (FL) is notorious for its vulnerability to Byzantine attacks. Most current Byzantine defenses share a common inductive bias: among all the gradients, the densely distributed ones are more likely to be honest. However,…

Machine Learning · Computer Science 2025-02-17 Yuchen Liu , Chen Chen , Lingjuan Lyu , Yaochu Jin , Gang Chen

In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the fusion center…

Cryptography and Security · Computer Science 2014-10-23 Bhavya Kailkhura , Swastik Brahma , Berkan Dulek , Yunghsiang S Han , Pramod K. Varshney

We study the fundamental problem of counting the number of nodes in a sparse network (of unknown size) under the presence of a large number of Byzantine nodes. We assume the full information model where the Byzantine nodes have complete…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-19 Soumyottam Chatterjee , Gopal Pandurangan , Peter Robinson

Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown beforehand, location. Robots are oblivious-- they…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-05-26 Zohir Bouzid , Maria Potop-Butucaru , Sébastien Tixeuil

In this paper, we investigate the challenging framework of Byzantine-robust training in distributed machine learning (ML) systems, focusing on enhancing both efficiency and practicality. As distributed ML systems become integral for complex…

Machine Learning · Computer Science 2024-09-04 Tehila Dahan , Kfir Y. Levy

Robust pulse synchronization is fundamental in constructing reliable synchronous applications in wired and wireless distributed systems. In wired systems, self-stabilizing Byzantine pulse synchronization aims for synchronizing fault-prone…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-09 Shaolin Yu , Jihong Zhu , Jiali Yang , Wei Lu

In this paper, we challenge the conventional approach of state machine replication systems to design deterministic agreement protocols in the eventually synchronous communication model. We first prove that no such protocol can guarantee…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-06 Alexander Spiegelman

The problem of distributed inference with M-ary quantized data at the sensors is investigated in the presence of Byzantine attacks. We assume that the attacker does not have knowledge about either the true state of the phenomenon of…

Information Theory · Computer Science 2014-01-15 V. Sriram Siddhardh , Nadendla , Yunghsiang S. Han , Pramod K. Varshney

Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…

Networking and Internet Architecture · Computer Science 2019-02-25 Ermin Sakic , Wolfgang Kellerer

Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-19 Christoph Lenzen , Julian Loss

We investigate the impact of Byzantine attacks in distributed detection under binary hypothesis testing. It is assumed that a fraction of the transmitted sensor measurements are compromised by the injected data from a Byzantine attacker,…

Information Theory · Computer Science 2019-05-27 Yuqing Ni , Kemi Ding , Yong Yang , Ling Shi

Transient faults corrupt the content and organization of data structures. A recovery technique dealing with such faults is stabilization, which guarantees, following some number of operations on the data structure, that content of the data…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-09-25 Ted Herman , Toshimitsu Masuzawa

In federated learning, multiple client devices jointly learn a machine learning model: each client device maintains a local model for its local training dataset, while a master device maintains a global model via aggregating the local…

Cryptography and Security · Computer Science 2021-11-23 Minghong Fang , Xiaoyu Cao , Jinyuan Jia , Neil Zhenqiang Gong

Implementations of SGD on distributed systems create new vulnerabilities, which can be identified and misused by one or more adversarial agents. Recently, it has been shown that well-known Byzantine-resilient gradient aggregation schemes…

Machine Learning · Computer Science 2022-09-26 Ali Ramezani-Kebrya , Iman Tabrizian , Fartash Faghri , Petar Popovski

The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another challenge is the lack of incentives at certain steps of the…

Cryptography and Security · Computer Science 2017-11-21 Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren , Alexander Spiegelman
‹ Prev 1 8 9 10 Next ›