arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.03559cs.LGcs.AIstat.ML
收藏

无模型规划研究

An investigation of model-free planning

DeepMind(深度思维)
Arthur Guez, Mehdi Mirza, Karol Gregor, Rishabh Kabra, Sébastien Racanière, Théophane Weber, David Raposo, Adam Santoro, Laurent Orseau, Tom Eccles, Greg Wayne,… 展开作者

Arthur Guez, Mehdi Mirza, Karol Gregor, Rishabh Kabra, Sébastien Racanière, Théophane Weber, David Raposo, Adam Santoro, Laurent Orseau, Tom Eccles, Greg Wayne, David Silver, Timothy Lillicrap

摘要:

强化学习(RL)领域正面临着越来越多的具有组合复杂性的挑战。对于RL代理来说,要解决这些挑战,它必须能够有效地进行规划。先前的工作通常利用环境的显式模型,结合特定的规划算法(如树搜索)。最近,已经提出了一种新的方法族,其通过经由函数逼近器(诸如树结构神经网络)中的归纳偏置提供用于规划的结构来学习如何规划,该函数逼近器由无模型RL算法进行端到端训练。在本文中,我们走得更远,并以经验证明,一个完全无模型的方法,没有特殊的结构超出标准的神经网络组件,如卷积网络和LSTM,可以学习表现出许多典型的特征与基于模型的规划。我们衡量我们的代理在规划方面的有效性,它的能力,概括在一个组合和不可逆的状态空间,它的数据效率,以及它的能力,利用额外的思考时间。我们发现,我们的代理人有许多特点,人们可能会期望在规划算法中找到。此外,它超过了最先进的挑战组合域,如推箱子,并优于其他无模型的方法,利用强归纳偏见的规划。

英文摘要:

The field of reinforcement learning (RL) is facing increasingly challenging domains with combinatorial complexity. For an RL agent to address these challenges, it is essential that it can plan effectively. Prior work has typically utilized an explicit model of the environment, combined with a specific planning algorithm (such as tree search). More recently, a new family of methods have been proposed that learn how to plan, by providing the structure for planning via an inductive bias in the function approximator (such as a tree structured neural network), trained end-to-end by a model-free RL algorithm. In this paper, we go even further, and demonstrate empirically that an entirely model-free approach, without special structure beyond standard neural network components such as convolutional networks and LSTMs, can learn to exhibit many of the characteristics typically associated with a model-based planner. We measure our agent's effectiveness at planning in terms of its ability to generalize across a combinatorial and irreversible state space, its data efficiency, and its ability to utilize additional thinking time. We find that our agent has many of the characteristics that one might expect to find in a planning algorithm. Furthermore, it exceeds the state-of-the-art in challenging combinatorial domains such as Sokoban and outperforms other model-free approaches that utilize strong inductive biases toward planning.

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

↑