arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.03020cs.LGcs.AI
收藏

SplAgger:用于元强化学习的分裂聚合

SplAgger: Split Aggregation for Meta-Reinforcement Learning

University of Oxford(牛津大学)

Jacob Beck, Matthew Jackson, Risto Vuorio, Zheng Xiong, Shimon Whiteson

AI总结:

本文提出 SplAgger,一种结合置换变异和不变组件的序列模型,用于元强化学习,在连续控制和记忆环境中优于所有基线。

摘要:

强化学习(RL)的核心目标是创建能够在新颖任务中快速学习的智能体。元强化学习旨在通过直接学习此类智能体来实现这一目标。黑盒方法通过端到端训练现成的序列模型来实现。相比之下,任务推断方法则明确推断未知任务的后验分布,通常使用不同的目标和专为任务推断设计的序列模型。最近的研究表明,任务推断方法对于优异性能并非必要。然而,尚不清楚即使不使用任务推断目标,任务推断序列模型是否仍然有益。在本文中,我们提供证据表明任务推断序列模型确实仍然有益。具体而言,我们研究了具有置换不变聚合的序列模型,这些模型利用了由于马尔可夫性质,任务后验不依赖于数据顺序这一事实。我们通过实验证实了在不使用任务推断目标的情况下,置换不变序列模型的优势。然而,我们惊讶地发现,在多种条件下,置换变异性仍然是有用的。因此,我们提出了 SplAgger,它同时使用置换变异和不变组件来实现两者的最佳结合,在连续控制和记忆环境上评估时优于所有基线。代码可在 https://github.com/jacooba/hyper 获取。

英文摘要:

A core ambition of reinforcement learning (RL) is the creation of agents capable of rapid learning in novel tasks. Meta-RL aims to achieve this by directly learning such agents. Black box methods do so by training off-the-shelf sequence models end-to-end. By contrast, task inference methods explicitly infer a posterior distribution over the unknown task, typically using distinct objectives and sequence models designed to enable task inference. Recent work has shown that task inference methods are not necessary for strong performance. However, it remains unclear whether task inference sequence models are beneficial even when task inference objectives are not. In this paper, we present evidence that task inference sequence models are indeed still beneficial. In particular, we investigate sequence models with permutation invariant aggregation, which exploit the fact that, due to the Markov property, the task posterior does not depend on the order of data. We empirically confirm the advantage of permutation invariant sequence models without the use of task inference objectives. However, we also find, surprisingly, that there are multiple conditions under which permutation variance remains useful. Therefore, we propose SplAgger, which uses both permutation variant and invariant components to achieve the best of both worlds, outperforming all baselines evaluated on continuous control and memory environments. Code is provided at https://github.com/jacooba/hyper.

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

↑