Action Assembly: Sparse Imitation Learning for Text Based Games with Combinatorial Action Spaces
We propose a computationally efficient algorithm that combines compressed sensing with imitation learning to solve text-based games with combinatorial action spaces. Specifically, we introduce a new compressed sensing algorithm, named IK-OMP, which can be seen as an extension to the Orthogonal Matching Pursuit (OMP). We incorporate IK-OMP into a supervised imitation learning setting and show that the combined approach (Sparse Imitation Learning, Sparse-IL) solves the entire text-based game of Zork1 with an action space of approximately 10 million actions given both perfect and noisy demonstrations.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingDecision MakingImitation Learningtext-based gamesWord EmbeddingsSimilar Papers 제목 키워드 기반
Play2Perfect: What Matters in Dexterous Play Pretraining for Precise Assembly?
Multi-fingered robots promise the speed and dexterity of human hands, yet challenging problems such as precise assembly have remained out of reach. These tasks are contact-rich, making data collection for imitation learn…
Reinforcement LearningA step toward a reinforcement learning de novo genome assembler
De novo genome assembly is a relevant but computationally complex task in genomics. Although de novo assemblers have been used successfully in several genomics projects, there is still no 'best assembler', and the choice…
Deep Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning+1Exploration Based Language Learning for Text-Based Games
This work presents an exploration and imitation-learning-based agent capable of state-of-the-art performance in playing text-based computer games. Text-based computer games describe their world to the player through natu…
Imitation Learningtext-based gamesText GenerationSelf-Imitation Advantage Learning
Self-imitation learning is a Reinforcement Learning (RL) method that encourages actions whose returns were higher than expected, which helps in hard exploration and sparse reward problems. It was shown to improve the per…
Atari GamesImitation LearningReinforcement Learning (RL)Algorithmic Improvements for Deep Reinforcement Learning applied to Interactive Fiction
Text-based games are a natural challenge domain for deep reinforcement learning algorithms. Their state and action spaces are combinatorially large, their reward function is sparse, and they are partially observable: the…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1