论文标题
在存在对抗沟通的情况下,基于高斯流程的消息过滤用于强大的多机构合作
Gaussian Process Based Message Filtering for Robust Multi-Agent Cooperation in the Presence of Adversarial Communication
论文作者
论文摘要
在本文中,我们考虑了在多代理系统中为对抗性沟通提供鲁棒性的问题。具体而言,我们提出了一种解决稳健合作的解决方案,该解决方案使多代理系统能够在存在匿名非合作剂的情况下保持高性能,以传达有缺陷,误导性或操纵性信息。为了实现这一目标,我们提出了一个基于图神经网络(GNN)的通信体系结构,该架构适合新型高斯过程(GP)基于基于的概率模型,该模型表征了由于其物理邻近性和相对位置而导致不同主体同时通信之间的相互信息。该模型允许代理商在本地计算近似的后验概率或信心,即任何给定的沟通伙伴都是真实的。这些信心可以用作消息过滤方案中的权重,从而抑制可疑沟通对接收代理决策的影响。为了评估我们方法的疗效,我们引入了非合作代理的分类法,该分类学通过可用的信息来区分它们。我们在两个不同的实验中证明了我们的方法在这种分类法中的表现优于替代方法。除了最好的知情对手之外,我们的过滤方法能够减少非合作剂造成的影响,从而将其降低到可忽略的地步,并且在没有对手的情况下,其性能可忽略不计。
In this paper, we consider the problem of providing robustness to adversarial communication in multi-agent systems. Specifically, we propose a solution towards robust cooperation, which enables the multi-agent system to maintain high performance in the presence of anonymous non-cooperative agents that communicate faulty, misleading or manipulative information. In pursuit of this goal, we propose a communication architecture based on Graph Neural Networks (GNNs), which is amenable to a novel Gaussian Process (GP)-based probabilistic model characterizing the mutual information between the simultaneous communications of different agents due to their physical proximity and relative position. This model allows agents to locally compute approximate posterior probabilities, or confidences, that any given one of their communication partners is being truthful. These confidences can be used as weights in a message filtering scheme, thereby suppressing the influence of suspicious communication on the receiving agent's decisions. In order to assess the efficacy of our method, we introduce a taxonomy of non-cooperative agents, which distinguishes them by the amount of information available to them. We demonstrate in two distinct experiments that our method performs well across this taxonomy, outperforming alternative methods. For all but the best informed adversaries, our filtering method is able to reduce the impact that non-cooperative agents cause, reducing it to the point of negligibility, and with negligible cost to performance in the absence of adversaries.