arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.08965cs.MAcs.LGquant-ph
收藏

通过量子纠缠协调多智能体强化学习

Learning to Coordinate via Quantum Entanglement in Multi-Agent Reinforcement Learning

Nasdaq, Inc(纳斯达克公司);University of Pennsylvania(宾夕法尼亚大学)

John Gardiner, Orlando Romero, Brendan Tivnan, Nicolò Dal Fabbro, George J. Pappas

AI总结:

本文提出利用量子纠缠的框架,通过可微策略参数化和量子协调器架构,实现多智能体强化学习中的无通信协作策略,展现量子优势。

摘要:

在多智能体强化学习(MARL)中,无法通信是协调的主要挑战。先前的工作探索了通过共享随机性来关联局部策略,有时以相关设备的形式出现,作为帮助去中心化决策的机制。相比之下,本文引入了第一个框架,用于训练MARL智能体利用共享量子纠缠作为协调资源,这允许比仅共享随机性更大的相关策略类。这受到量子物理中已知结果的启发,这些结果指出,在某些无通信的单轮合作游戏中,共享量子纠缠可以产生优于仅使用共享随机性的策略。在这种情况下,我们说存在量子优势。我们的框架基于一种新颖的可微策略参数化方法,使能够优化量子测量,以及一种新颖的策略架构,将联合策略分解为量子协调器和去中心化的局部执行者。为了说明所提方法的有效性,我们首先展示可以通过纯经验学习,在被视为黑箱或acles的单轮游戏中获得量子优势的策略。然后展示我们的机器如何在示例性的多智能体顺序决策问题中学习具有量子优势的策略,该问题被建模为去中心化的部分可观测马尔可夫决策过程(Dec-POMDP)。

英文摘要:

The inability to communicate poses a major challenge to coordination in multi-agent reinforcement learning (MARL). Prior work has explored correlating local policies via shared randomness, sometimes in the form of a correlation device, as a mechanism to assist in decentralized decision-making. In contrast, this work introduces the first framework for training MARL agents to exploit shared quantum entanglement as a coordination resource, which permits a larger class of communication-free correlated policies than shared randomness alone. This is motivated by well-known results in quantum physics which posit that, for certain single-round cooperative games with no communication, shared quantum entanglement enables strategies that outperform those that only use shared randomness. In such cases, we say that there is quantum advantage. Our framework is based on a novel differentiable policy parameterization that enables optimization over quantum measurements, together with a novel policy architecture that decomposes joint policies into a quantum coordinator and decentralized local actors. To illustrate the effectiveness of our proposed method, we first show that we can learn, purely from experience, strategies that attain quantum advantage in single-round games that are treated as black box oracles. We then demonstrate how our machinery can learn policies with quantum advantage in an illustrative multi-agent sequential decision-making problem formulated as a decentralized partially observable Markov decision process (Dec-POMDP).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑