Byzantine-Resilient Multi-Agent Optimization
Byzantine-Resilient Multi-Agent Optimization
复制标题
拜占庭弹性多代理优化
DOI：
10.1109/tac.2020.3008139
复制
发表时间：
2021
影响因子：
6.8
通讯作者：
Vaidya, N.H.
中科院分区：
文献类型：
--
作者：
Vaidya, N.H.
我们考虑多智能体优化问题，其中未知的智能体子集会遭受拜占庭错误，从而表现出对抗性。我们假设每个智能体 i 都有一个局部成本函数 fi，并且优秀智能体的总体目标是协作最小化正确聚合这些局部成本函数的全局目标。据我们所知，我们是第一批研究不存在中央协调代理的拜占庭弹性优化的人之一，并且我们是第一批描述可实现的全局目标的凸系数结构的人。处理拜占庭错误非常具有挑战性。例如，与无故障网络相比，即使在最简单的设置中达成拜占庭弹性协议也绝非易事。我们通过关注标量局部成本函数，朝着解决所提出的拜占庭弹性多智能体优化问题迈出了一步。我们的结果可能为一般局部成本函数提供有用的见解。
We consider the problem of multiagent optimization wherein an unknown subset of agents suffer Byzantine faults and thus behave adversarially. We assume that each agent i has a local cost function fi, and the overarching goal of the good agents is to collaboratively minimize a global objective that properly aggregates these local cost functions. To the best of our knowledge, we are among the first to study Byzantine-resilient optimization where no central coordinating agent exists, and we are the first to characterize the structures of the convex coefficients of the achievable global objectives. Dealing with Byzantine faults is very challenging. For example, in contrast to fault-free networks, reaching Byzantine-resilient agreement even in the simplest setting is far from trivial. We take a step toward solving the proposed Byzantine-resilient multiagent optimization problem by focusing on scalar local cost functions. Our results might provide useful insights for the general local cost functions.