Model-based Reinforcement Learning with Multi-step Plan Value Estimation
A promising way to improve the sample efficiency of reinforcement learning is model-based methods, in which many explorations and evaluations can happen in the learned models to save real-world samples. However, when the learned model has a non-negligible model error, sequential steps in the model are hard to be accurately evaluated, limiting the model's utilization. This paper proposes to alleviate this issue by introducing multi-step plans to replace multi-step actions for model-based RL. We employ the multi-step plan value estimation, which evaluates the expected discounted return after executing a sequence of action plans at a given state, and updates the policy by directly computing the multi-step policy gradient via plan value estimation. The new model-based reinforcement learning algorithm MPPVE (Model-based Planning Policy Learning with Multi-step Plan Value Estimation) shows a better utilization of the learned model and achieves a better sample efficiency than state-of-the-art model-based RL approaches.
Code (1)
Tasks
Model-based Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Combating the Compounding-Error Problem with a Multi-step Model
Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a sta…
Model-based Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)The Effect of Multi-step Methods on Overestimation in Deep Reinforcement Learning
Multi-step (also called n-step) methods in reinforcement learning (RL) have been shown to be more efficient than the 1-step method due to faster propagation of the reward signal, both theoretically and empirically, in ta…
Deep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)Generative Planning for Temporally Coordinated Exploration in Reinforcement Learning
Standard model-free reinforcement learning algorithms optimize a policy that generates the action to be taken in the current time step in order to maximize expected future return. While flexible, it faces difficulties ar…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)How to Combine Tree-Search Methods in Reinforcement Learning
Finite-horizon lookahead policies are abundantly used in Reinforcement Learning and demonstrate impressive empirical success. Usually, the lookahead policies are implemented with specific planning methods such as Monte C…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Gamma-Nets: Generalizing Value Estimation over Timescale
We present $\Gamma$-nets, a method for generalizing value function estimation over timescale. By using the timescale as one of the estimator's inputs we can estimate value for arbitrary timescales. As a result, the predi…
Deep Reinforcement LearningLifelong learningReinforcement LearningRepresentation Learning