English

Counting to Explore and Generalize in Text-based Games

Computation and Language 2019-03-08 v2 Machine Learning

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.

Keywords

Cite

@article{arxiv.1806.11525,
  title  = {Counting to Explore and Generalize in Text-based Games},
  author = {Xingdi Yuan and Marc-Alexandre Côté and Alessandro Sordoni and Romain Laroche and Remi Tachet des Combes and Matthew Hausknecht and Adam Trischler},
  journal= {arXiv preprint arXiv:1806.11525},
  year   = {2019}
}
R2 v1 2026-06-23T02:46:20.071Z