Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learning Dynamic Belief Graphs to Generalize on Text-Based Games (2002.09127v4)

Published 21 Feb 2020 in cs.CL and cs.LG

Abstract: Playing text-based games requires skills in processing natural language and sequential decision making. Achieving human-level performance on text-based games remains an open challenge, and prior research has largely relied on hand-crafted structured representations and heuristics. In this work, we investigate how an agent can plan and generalize in text-based games using graph-structured representations learned end-to-end from raw text. We propose a novel graph-aided transformer agent (GATA) that infers and updates latent belief graphs during planning to enable effective action selection by capturing the underlying game dynamics. GATA is trained using a combination of reinforcement and self-supervised learning. Our work demonstrates that the learned graph-based representations help agents converge to better policies than their text-only counterparts and facilitate effective generalization across game configurations. Experiments on 500+ unique games from the TextWorld suite show that our best agent outperforms text-based baselines by an average of 24.2%.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (10)
  1. Ashutosh Adhikari (5 papers)
  2. Xingdi Yuan (46 papers)
  3. Marc-Alexandre Côté (42 papers)
  4. Mikuláš Zelinka (4 papers)
  5. Marc-Antoine Rondeau (5 papers)
  6. Romain Laroche (36 papers)
  7. Pascal Poupart (80 papers)
  8. Jian Tang (327 papers)
  9. Adam Trischler (50 papers)
  10. William L. Hamilton (46 papers)
Citations (77)

Summary

We haven't generated a summary for this paper yet.