Methods › Reinforcement Learning › Q-Learning Networks › Dueling Network

Dueling Network

23 papers tagged archive 2025-07-28

Introduced by Ziyu Wang et al. in Dueling Network Architectures for Deep Reinforcement Learning

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

A Dueling Network is a type of Q-Network that has two streams to separately estimate (scalar) state-value and the advantages for each action. Both streams share a common convolutional feature learning module. The two streams are combined via a special aggregating layer to produce an estimate of the state-action value function Q as shown in the figure to the right.

The last module uses the following mapping:

Q(s, a, θ, α, β) =V(s, θ, β) + (A(s, a, θ, α) - 1/(|𝒜|)∑_(a′)A(s, a′; θ, α))

This formulation is chosen for identifiability so that the advantage function has zero advantage for the chosen action, but instead of a maximum we use an average operator to increase the stability of the optimization.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Dueling World Models; Neural Dueling Bandits; Dueling Deep Q-Learning; Riemannian Dueling Frank-Wolfe (RDFW); dueling-neighborhood search meta-algorithm; dueling bandits framework for Elo evaluation; Riemannian Dueling Normalized Gradient Descent (RDNGD); Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 23 · with a code link: 14 · where Syntology ran a sample: 7 (6 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (7 of 23 tagged: 6 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 23 of 23, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 25 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Reinforcement Learning (RL)18
Deep Reinforcement Learning17
Reinforcement Learning15
reinforcement-learning15
Atari Games7
Q-Learning5
Decision Making3
Efficient Exploration2
Multi-agent Reinforcement Learning2
OpenAI Gym2
Starcraft2
Computational Efficiency1
Continuous Control1
Distributional Reinforcement Learning1
Diversity1
Ensemble Learning1
Game of Go1
General Reinforcement Learning1
Management1
Montezuma's Revenge1

Usage over time archive 2025-07-28

Papers per year tagged with Dueling Network: 2015 to 2024, peak 6 6 0 2015: 1 paper 2015 2016: 2 papers 2016 2017: 2 papers 2017 2018: 2 papers 2018 2019: 2 papers 2019 2020: 6 papers 2020 2021: 3 papers 2021 2022: 2 papers 2022 2023: 2 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (23 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Q-Learning Networks

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections