A State Representation Dueling Network for Deep Reinforcement Learning
In recent years there have been many successes in boosting the performance of Deep Q-Networks (DQN). Dueling DQN uses simple dueling architecture but significantly improves the performance of DQN [1]. However, Dueling DQN is only concerned about dueling in estimating Q-values. In this paper, we introduce a state representation dueling network, which provides an auxiliary task designed to be combined with other reinforcement learning algorithms to improve the performance of Deep RL. The state representation dueling network is designed to be beneficial for solving reinforcement learning tasks with high dimensional observation, such as camera input. The experiment shows that adding the state representation dueling network to Dueling DQN improves both the training speed and performance of Dueling DQN in CartPole environment.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningGeneral Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Methods 이 논문이 사용한 방법론
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+1Maximum 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 pro…
reinforcement-learningReinforcement Learning (RL)QPLEX: Duplex Dueling Multi-Agent Q-Learning
We explore value-based multi-agent reinforcement learning (MARL) in the popular paradigm of centralized training with decentralized execution (CTDE). CTDE has an important concept, Individual-Global-Max (IGM) principle, …
Decision MakingMulti-agent Reinforcement LearningQ-LearningStarcraft+1KLUCB Approach to Copeland Bandits
Multi-armed bandit(MAB) problem is a reinforcement learning framework where an agent tries to maximise her profit by proper selection of actions through absolute feedback for each action. The dueling bandits problem is a…
Information RetrievalReinforcement LearningRetrievalThompson SamplingSpectral Analysis of Dueling Q-Learning
Q-learning is a fundamental algorithm in reinforcement learning (RL) for solving discounted Markov decision processes (MDPs) when the transition kernel is unknown. The deep Q-network (DQN) extends Q-learning by using a d…
Reinforcement Learning