arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2109.09031cs.LGstat.ML
收藏

基于后见之明的Meta-强化学习的前景重新标记

Hindsight Foresight Relabeling for Meta-Reinforcement Learning

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Tsinghua University(清华大学);HeliXon Limited(HeliXon有限公司)

Michael Wan, Jian Peng, Tanmay Gangwani

摘要:

Meta-强化学习(meta-RL)算法允许代理从少量经验中学习新行为,从而缓解RL中的样本效率低下问题。然而,虽然元RL代理可以在测试时快速适应新任务,但元训练过程仍然是样本效率低下的。先前的工作已经发现,在多任务RL设置中,重新标记过去的转换,从而在任务之间共享经验,可以提高样本效率和渐近性能。我们将这一想法应用到元RL设置中,并设计了一种新的重新标记方法,称为后见之明重新标记(HFR)。我们使用“后见之明”和“远见”的组合构建了一个重新标记分布,后见之明用于使用来自训练任务分布的奖励函数重新标记轨迹,而远见则采用重新标记的轨迹并计算每个任务的每个轨迹的效用。HFR易于实现,并且与现有的元RL算法兼容。我们发现,HFR在各种元RL任务上与其他重新标记方法相比提高了性能。

英文摘要:

Meta-reinforcement learning (meta-RL) algorithms allow for agents to learn new behaviors from small amounts of experience, mitigating the sample inefficiency problem in RL. However, while meta-RL agents can adapt quickly to new tasks at test time after experiencing only a few trajectories, the meta-training process is still sample-inefficient. Prior works have found that in the multi-task RL setting, relabeling past transitions and thus sharing experience among tasks can improve sample efficiency and asymptotic performance. We apply this idea to the meta-RL setting and devise a new relabeling method called Hindsight Foresight Relabeling (HFR). We construct a relabeling distribution using the combination of "hindsight", which is used to relabel trajectories using reward functions from the training task distribution, and "foresight", which takes the relabeled trajectories and computes the utility of each trajectory for each task. HFR is easy to implement and readily compatible with existing meta-RL algorithms. We find that HFR improves performance when compared to other relabeling methods on a variety of meta-RL tasks.

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

↑