Fault-Tolerance in Distributed Optimization: The Case of Redundancy
Nirupam Gupta, Nitin H. Vaidya
Abstract
This paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function. The goal of a distributed optimization algorithm is to allow the agents to collectively compute a minimum 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 send arbitrary or incorrect information regarding their local cost functions. Unless a fault-tolerance mechanism is employed, traditional distributed optimization algorithms cannot tolerate such faulty agents.
Topics & Concepts
Redundancy (engineering)Computer scienceFault toleranceByzantine fault toleranceDistributed computingFunction (biology)Optimization problemDistributed algorithmMathematical optimizationAlgorithmMathematicsEvolutionary biologyOperating systemBiologyDistributed Control Multi-Agent SystemsPrivacy-Preserving Technologies in DataOptimization and Search Problems