In Little Alchemy 2, most LLMs discover fewer elements than humans and rely on uncertainty rather than empowerment; reasoning models o1 and DeepSeek-R1 explore more effectively.
Playing Text-Adventure Games with Graph-Based Deep Reinforcement Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Text-based adventure games provide a platform on which to explore reinforcement learning in the context of a combinatorial action space, such as natural language. We present a deep reinforcement learning architecture that represents the game state as a knowledge graph which is learned during exploration. This graph is used to prune the action space, enabling more efficient exploration. The question of which action to take can be reduced to a question-answering task, a form of transfer learning that pre-trains certain parts of our architecture. In experiments using the TextWorld framework, we show that our proposed technique can learn a control policy faster than baseline alternatives. We have also open-sourced our code at https://github.com/rajammanabrolu/KG-DQN.
citation-role summary
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Large Language Models Think Too Fast To Explore Effectively
In Little Alchemy 2, most LLMs discover fewer elements than humans and rely on uncertainty rather than empowerment; reasoning models o1 and DeepSeek-R1 explore more effectively.