Byzantine Fault-Tolerance in Decentralized Optimization under Minimal Redundancy

09/30/2020
by   Nirupam Gupta, et al.
0

This paper considers the problem of Byzantine fault-tolerance in multi-agent decentralized optimization. In this problem, each agent has a local cost function. The goal of a decentralized optimization algorithm is to allow the agents to cooperatively compute a common minimum point of their aggregate cost function. We consider the case when a certain number of agents may be Byzantine faulty. Such faulty agents may not follow a prescribed algorithm, and they may share arbitrary or incorrect information with other non-faulty agents. Presence of such Byzantine agents renders a typical decentralized optimization algorithm ineffective. We propose a decentralized optimization algorithm with provable exact fault-tolerance against a bounded number of Byzantine agents, provided the non-faulty agents have a minimal redundancy.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/21/2020

Resilience in Collaborative Optimization: Redundant and Independent Cost Functions

This report considers the problem of Byzantine fault-tolerance in multi-...
03/19/2020

Byzantine-Resilient Distributed Optimization of Multi-Dimensional Functions

The problem of distributed optimization requires a group of agents to re...
01/28/2021

Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent

We consider the problem of Byzantine fault-tolerance in the peer-to-peer...
02/03/2018

Scheduling and Checkpointing optimization algorithm for Byzantine fault tolerance in Cloud Clusters

Among those faults Byzantine faults offers serious challenge to fault to...
03/20/2019

Byzantine Fault Tolerant Distributed Linear Regression

This paper considers the problem of Byzantine fault tolerant distributed...
02/04/2022

SignSGD: Fault-Tolerance to Blind and Byzantine Adversaries

Distributed learning has become a necessity for training ever-growing mo...