REVIEW 2 cited by
Playing Text-Adventure Games with Graph-Based Deep Reinforcement Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
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.
-
AI Reasoning for Wireless Communications and Networking: A Survey and Perspectives
A survey that organizes LLM and AI reasoning methods into a taxonomy and maps them onto the physical, link, network, transport, and application layers of wireless networks.
Discussion (0). Continue with ORCID to comment.