多智能体协作中用分散记忆快速适应新任务
Multi-agent In-context Coordination via Decentralized Memory Retrieval
- 用集中嵌入模型捕捉轨迹特征,分散模型近似获取团队信息
- 通过检索相关轨迹上下文,实现比现有方法更快的任务适配
- 适合需要快速协作的复杂环境,如游戏和机器人任务
大型Transformer模型在无需参数更新的情况下,可对未见过的任务实现出色的少样本表现。这一能力也被引入强化学习(RL),智能体通过与环境交互获取上下文以最大化累积奖励,在复杂场景中展现出强适应性。然而,在合作式多智能体强化学习(MARL)中,分散策略部署可能导致任务对齐与奖励分配不一致,限制策略适应效率。为此,我们提出多智能体上下文协作机制(MAICC),通过训练集中嵌入模型捕捉细粒度轨迹表示,再由分散模型近似该模型以获得团队级任务信息。基于学习到的嵌入,检索相关轨迹作为上下文,结合智能体当前子轨迹用于决策。执行时引入新颖的记忆机制,平衡测试时在线数据与离线记忆。基于构建的记忆,提出融合个体与团队回报的混合效用分数,确保跨智能体的信用分配。在协作式MARL基准(包括层级觅食任务(LBF)和SMAC(v1/v2))上的大量实验表明,相较于现有方法,MAICC能更快速适应未见任务。代码已公开于https://github.com/LAMDA-RL/MAICC。
原文摘要 · Abstract (English)
Large transformer models, trained on diverse datasets, have demonstrated impressive few-shot performance on previously unseen tasks without requiring parameter updates. This capability has also been explored in Reinforcement Learning (RL), where agents interact with the environment to retrieve context and maximize cumulative rewards, showcasing strong adaptability in complex settings. However, in cooperative Multi-Agent Reinforcement Learning (MARL), where agents must coordinate toward a shared goal, decentralized policy deployment can lead to mismatches in task alignment and reward assignment, limiting the efficiency of policy adaptation. To address this challenge, we introduce Multi-agent In-context Coordination via Decentralized Memory Retrieval (MAICC), a novel approach designed to enhance coordination by fast adaptation. Our method involves training a centralized embedding model to capture fine-grained trajectory representations, followed by decentralized models that approximate the centralized one to obtain team-level task information. Based on the learned embeddings, relevant trajectories are retrieved as context, which, combined with the agents' current sub-trajectories, inform decision-making. During decentralized execution, we introduce a novel memory mechanism that effectively balances test-time online data with offline memory. Based on the constructed memory, we propose a hybrid utility score that incorporates both individual- and team-level returns, ensuring credit assignment across agents. Extensive experiments on cooperative MARL benchmarks, including Level-Based Foraging (LBF) and SMAC (v1/v2), show that MAICC enables faster adaptation to unseen tasks compared to existing methods. Code is available at https://github.com/LAMDA-RL/MAICC.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。