Density-Based Bonuses on Learned Representations for Reward-Free Exploration in Deep Reinforcement Learning
In this paper, we study the problem of representation learning and exploration in reinforcement learning. We propose a framework to compute exploration bonuses based on density estimation, that can be used with any representation learning method, and that allows the agent to explore without extrinsic rewards. In the special case of tabular Markov decision processes (MDPs), this approach mimics the behavior of theoretically sound algorithms. In continuous and partially observable MDPs, the same approach can be applied by learning a latent representation, on which a probability density is estimated.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningDensity Estimationreinforcement-learningReinforcement Learning (RL)Representation LearningSimilar Papers 제목 키워드 기반
Exploration via Elliptical Episodic Bonuses
In recent years, a number of reinforcement learning (RL) methods have been proposed to explore complex environments which differ across episodes. In this work, we show that the effectiveness of these methods critically r…
Reinforcement Learning (RL)Value Bonuses using Ensemble Errors for Exploration in Reinforcement Learning
Optimistic value estimates provide one mechanism for directed exploration in reinforcement learning (RL). The agent acts greedily with respect to an estimate of the value plus what can be seen as a value bonus. The value…
Reinforcement LearningReward Bonuses with Gain Scheduling Inspired by Iterative Deepening Search
This paper introduces a novel method of adding intrinsic bonuses to task-oriented reward function in order to efficiently facilitate reinforcement learning search. While various bonuses have been designed to date, they a…
SchedulingFast active learning for pure exploration in reinforcement learning
Realistic environments often provide agents with very limited feedback. When the environment is initially unknown, the feedback, in the beginning, can be completely absent, and the agents may first choose to devote all t…
Active Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Task-Aware Exploration via a Predictive Bisimulation Metric
Accelerating exploration in visual reinforcement learning under sparse rewards remains challenging due to the substantial task-irrelevant variations. Despite advances in intrinsic exploration, many methods either assume …
Reinforcement Learning