Maximum Entropy Dueling Network Architecture in Atari Domain
In recent years, there have been many deep structures for Reinforcement Learning, mainly for value function estimation and representations. These methods achieved great success in Atari 2600 domain. In this paper, we propose an improved architecture based upon Dueling Networks, in this architecture, there are two separate estimators, one approximate the state value function and the other, state advantage function. This improvement based on Maximum Entropy, shows better policy evaluation compared to the original network and other value-based architectures in Atari domain.
Code (0)
등록된 구현이 없습니다.
Tasks
reinforcement-learningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Dueling Network Architectures for Deep Reinforcement Learning
In recent years there have been many successes of using deep representations in reinforcement learning. Still, many of these applications use conventional architectures, such as convolutional networks, LSTMs, or auto-enc…
Atari GamesDeep Reinforcement Learningreinforcement-learningReinforcement Learning+1Learning To Play Atari Games Using Dueling Q-Learning and Hebbian Plasticity
In this work, an advanced deep reinforcement learning architecture is used to train neural network agents playing atari games. Given only the raw game pixels, action space, and reward information, the system can train ag…
Atari GamesDeep Reinforcement LearningLifelong learningQ-LearningSample Efficient Actor-Critic with Experience Replay
This paper presents an actor-critic deep reinforcement learning agent with experience replay that is stable, sample efficient, and performs remarkably well on challenging environments, including the discrete 57-game Atar…
continuous-controlContinuous ControlDeep Reinforcement Learningreinforcement-learning+2DSAC-C: Constrained Maximum Entropy for Robust Discrete Soft-Actor Critic
We present a novel extension to the family of Soft Actor-Critic (SAC) algorithms. We argue that based on the Maximum Entropy Principle, discrete SAC can be further improved via additional statistical constraints derived …
Atari Gamesreinforcement-learningNoisy Networks for Exploration
We introduce NoisyNet, a deep reinforcement learning agent with parametric noise added to its weights, and show that the induced stochasticity of the agent's policy can be used to aid efficient exploration. The parameter…
Atari GamesDeep Reinforcement LearningEfficient Explorationreinforcement-learning+2