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

基于有序记忆策略网络的学习任务分解

Learning Task Decomposition with Ordered Memory Policy Network

University of Montreal(蒙特利尔大学);Mila(米拉研究所);Peking University(北京大学);MIT(麻省理工学院);MIT-IBM Watson AI Lab(麻省理工学院-IBM沃森人工智能实验室)

Yuchen Lu, Yikang Shen, Siyuan Zhou, Aaron Courville, Joshua B. Tenenbaum, Chuang Gan

摘要:

许多复杂的现实世界的任务是由几个层次的子任务。人类利用这些层次结构来加速学习过程并实现更好的泛化。在这项工作中,我们研究了归纳偏差,并提出有序记忆策略网络(OMPN),发现子任务的层次结构,从示教学习。发现的子任务层次结构可用于执行任务分解,在非结构化演示中恢复子任务边界。在Craft和Dial上的实验表明,与强基线相比,该模型在无监督和弱监督环境下都能获得更高的任务分解性能. OMPN也可以直接应用于部分可观测的环境中,并且仍然可以获得更高的任务分解性能。我们的可视化进一步证实了子任务层次结构可以出现在我们的模型中。

英文摘要:

Many complex real-world tasks are composed of several levels of sub-tasks. Humans leverage these hierarchical structures to accelerate the learning process and achieve better generalization. In this work, we study the inductive bias and propose Ordered Memory Policy Network (OMPN) to discover subtask hierarchy by learning from demonstration. The discovered subtask hierarchy could be used to perform task decomposition, recovering the subtask boundaries in an unstruc-tured demonstration. Experiments on Craft and Dial demonstrate that our modelcan achieve higher task decomposition performance under both unsupervised and weakly supervised settings, comparing with strong baselines. OMPN can also bedirectly applied to partially observable environments and still achieve higher task decomposition performance. Our visualization further confirms that the subtask hierarchy can emerge in our model.

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

↑