Counting to Explore and Generalize in Text-based Games
Xingdi Yuan Affiliation: Microsoft Research Marc-Alexandre Côté Affiliation: Microsoft Research Correspondence to: Alessandro Sordoni Affiliation: Microsoft Research Romain Laroche Affiliation: Microsoft Research Remi Tachet des Combes Affiliation: Microsoft Research Matthew Hausknecht Affiliation: Microsoft Research Adam Trischler Affiliation: Microsoft Research
Abstract
We propose a recurrent RL agent with an episodic exploration mechanism that helps discovering good policies in text-based game environments. We show promising results on a set of generated text-based games of varying difficulty where the goal is to collect a coin located at the end of a chain of rooms. In contrast to previous text-based RL approaches, we observe that our agent learns policies that generalize to unseen games of greater difficulty.
原文 arXiv:1806.11525;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1806.11525v2