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

积极探索符号表征的学习

Active Exploration for Learning Symbolic Representations

Brown University(布朗大学)

Garrett Andersen, George Konidaris

摘要:

我们介绍了一个在线的主动探索算法,数据有效地学习一个抽象的符号模型的环境。我们的算法分为两个部分:第一部分快速生成一个中间贝叶斯符号模型的数据,该代理已经收集到目前为止,该代理可以使用与第二部分,以指导其未来的探索对区域的状态空间,该模型是不确定的。我们表明,我们的算法优于随机和贪婪的探索政策在两个不同的计算机游戏域。第一个领域是一个小行星启发的游戏,具有复杂的动态但基本的逻辑结构。第二个是宝藏游戏,动力学更简单,但逻辑结构更复杂。

英文摘要:

We introduce an online active exploration algorithm for data-efficiently learning an abstract symbolic model of an environment. Our algorithm is divided into two parts: the first part quickly generates an intermediate Bayesian symbolic model from the data that the agent has collected so far, which the agent can then use along with the second part to guide its future exploration towards regions of the state space that the model is uncertain about. We show that our algorithm outperforms random and greedy exploration policies on two different computer game domains. The first domain is an Asteroids-inspired game with complex dynamics but basic logical structure. The second is the Treasure Game, with simpler dynamics but more complex logical structure.

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

↑