Maximum Entropy Dueling Network Architecture

07/30/2021
by   Alireza Nadali, et al.
0

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.

READ FULL TEXT

page 3

page 4

page 5

research
08/26/2020

Inverse Policy Evaluation for Value-based Sequential Decision-making

Value-based methods for reinforcement learning lack generally applicable...
research
02/20/2021

Decoupling Value and Policy for Generalization in Reinforcement Learning

Standard deep reinforcement learning algorithms use a shared representat...
research
05/29/2023

VA-learning as a more efficient alternative to Q-learning

In reinforcement learning, the advantage function is critical for policy...
research
06/27/2012

A compact, hierarchical Q-function decomposition

Previous work in hierarchical reinforcement learning has faced a dilemma...
research
01/19/2023

Advanced Scaling Methods for VNF deployment with Reinforcement Learning

Network function virtualization (NFV) and software-defined network (SDN)...
research
02/23/2021

Greedy Multi-step Off-Policy Reinforcement Learning

Multi-step off-policy reinforcement learning has achieved great success....
research
03/28/2022

Revisiting Model-based Value Expansion

Model-based value expansion methods promise to improve the quality of va...

Please sign up or login with your details

Forgot password? Click here to reset