让机器人用压缩记忆长期保持环境感知,提升决策能力。
Memo: Training Memory-Efficient Embodied Agents with Reinforcement Learning
- 用周期性摘要标记插入输入,让Transformer主动构建和调用记忆
- 在网格世界和真实室内场景中,比全上下文模型更高效且表现更好
- 适合长时序、高计算成本受限的智能体任务,如机器人导航
为使具身智能体在长时间内有效运作,需发展能形成并访问记忆的模型以保持环境上下文。当前基于Transformer的策略在具身序列决策任务中,常因视觉输入过载而受制于上下文长度,而人类可将一生经验压缩为记忆。理论上存在显著压缩空间,因大量输入信息无关且可抽象。现有方法多聚焦于固定大小记忆的循环模型或依赖完整上下文的Transformer。本文提出Memo,一种面向记忆密集型、长时程任务的Transformer架构与训练方案。Memo通过在训练时交替插入周期性摘要标记,实现记忆的创建与检索。我们在网格世界元强化学习基准和照片级真实感室内多物体导航任务上验证其有效性。Memo优于朴素长上下文Transformer基线,在计算与存储上更高效。此外,推理时对更长上下文具有更强泛化能力,且在流式设置下仍保持鲁棒,其中历史上下文需截断以适应推理约束。代码已开源:https://github.com/gunshi/memo。
原文摘要 · Abstract (English)
To enable embodied agents to operate effectively over extended timeframes, it is crucial to develop models that form and access memories to stay contextualized in their environment. In the current paradigm of training transformer-based policies for embodied sequential decision-making tasks, visual inputs often overwhelm the context limits of transformers, while humans can maintain and utilize a lifetime of experience compressed as memories. Significant compression is possible in principle, as much of the input is irrelevant and can be abstracted. However, existing approaches predominantly focus on either recurrent models with fixed-size memory or transformers with full-context reliance. In this work, we propose Memo, a transformer-based architecture and training recipe for reinforcement learning (RL) on memory-intensive, long-horizon tasks. Memo incorporates the creation and retrieval of memory by interleaving periodic summarization tokens with the inputs of a model during training. We demonstrate Memo's effectiveness on a gridworld meta-RL benchmark and a multi-object navigation task in photo-realistic indoor settings. Memo outperforms naive long-context transformer baselines while being more compute and storage efficient. Additionally, Memo generalizes better to longer contexts at inference time and remains robust in streaming settings, where historical context must be truncated to fit inference constraints. Our code is available at: https://github.com/gunshi/memo.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。