mlsanityData to 14 Oct 2026

Maximum Entropy Dueling Network Architecture in Atari Domain

arXiv 2107.14457 ↗First posted 30 Jul 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 29 references that are in the map. First posted on arXiv 30 Jul 2021.

Builds on

10 of 29 references.

References · 10

  1. 2015Trust Region Policy Optimizationcited by 2,580
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  3. 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
  4. 2015End-to-End Training of Deep Visuomotor Policiescited by 875
  5. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
  6. 2017Reinforcement Learning with Deep Energy-Based Policiescited by 669
  7. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 503
  8. 2016Learning to Optimizecited by 195
  9. 2015Massively Parallel Methods for Deep Reinforcement Learningcited by 82
  10. 2019Learning Multi-Robot Decentralized Macro-Action-Based Policies via a Centralized Q-Netcited by 12

Built on by

Not cited yet.