Search Results for author:
Found 4 papers, 3 papers with code
The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learning
This paper introduces a set of formally defined and transparent problems for reinforcement learning algorithms with the following characteristics: (1) variable degrees of observability (non-Markov observations), (2) distal and sparse rewards, (3) variable and hierarchical reward structure, (4) multiple-task generation, (5) variable problem complexity.
Exploration in Deep Reinforcement Learning: A Survey
This paper reviews exploration techniques in deep reinforcement learning.
Evolving Inborn Knowledge For Fast Adaptation in Dynamic POMDP Problems
Rapid online adaptation to changing tasks is an important problem in machine learning and, recently, a focus of meta-reinforcement learning.
Deep Reinforcement Learning with Modulated Hebbian plus Q Network Architecture
This paper presents a new neural architecture that combines a modulated Hebbian network (MOHN) with DQN, which we call modulated Hebbian plus Q network architecture (MOHQA).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
