论文标题
弹性分布式优化
Resilient Distributed Optimization
论文作者
论文摘要
本文认为，在能够在通信网络中引入不信任信息的拜占庭式代理存在的分布式优化问题。基于图冗余和客观冗余，提出了弹性分布的亚级别算法。结果表明，在适当的假设下，算法使所有非Byzantine剂的状态渐近地融合到相同的最佳点。还提供了部分收敛率结果。
This paper considers a distributed optimization problem in the presence of Byzantine agents capable of introducing untrustworthy information into the communication network. A resilient distributed subgradient algorithm is proposed based on graph redundancy and objective redundancy. It is shown that the algorithm causes all non-Byzantine agents' states to asymptotically converge to the same optimal point under appropriate assumptions. A partial convergence rate result is also provided.
