# Byzantine Multi-Agent Optimization: Part II

arXiv: https://arxiv.org/abs/1507.01845 · HTML: https://mlsanity.com/paper/1507.01845/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jul 2015.

## Built on by (most cited first, 1 of 1)

- [Decentralized Ranking Aggregation via Gossip: Convergence and Robustness](https://mlsanity.com/paper/2602.22847/) (2026)

## Abstract (arXiv)

In Part I of this report, we introduced a Byzantine fault-tolerant distributed optimization problem whose goal is to optimize a sum of convex (cost) functions with real-valued scalar input/ouput. In this second part, we introduce a condition-based variant of the original problem over arbitrary directed graphs. Specifically, for a given collection of k input functions h1(x), ldots, hk(x), we consider the scenario when the local cost function stored at agent j, denoted by gj(x), is formed as a convex combination of the k input functions h1(x), ldots, hk(x). The goal of this condition-based problem is to generate an output that is an optimum of frac1ksumi=1k hi(x). Depending on the availability of side information at each agent, two slightly different variants are considered. We show that for a given graph, the problem can indeed be solved despite the presence of faulty agents. In particular, even in the absence of side information at each agent, when adequate redundancy is available in the optima of input functions, a distributed algorithm is proposed in which each agent carries minimal state across iterations.