Methods › Reinforcement Learning › Q-Learning Networks › NoisyNet-Dueling
NoisyNet-Dueling
Introduced by Meire Fortunato et al. in Noisy Networks for Exploration
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
NoisyNet-Dueling is a modification of a Dueling Network that utilises noisy linear layers for exploration instead of ϵ-greedy exploration as in the original Dueling formulation.
Papers archive 2025-07-28
1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
Noisy Networks for Exploration 30 Jun 2017 · 15 repositories · arXiv:1706.10295Syntology ran 1 of 3 samples · 2 unverified · 3 pointer-only (licence)
Tasks archive 2025-07-28
6 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Atari Games | 1 |
| Deep Reinforcement Learning | 1 |
| Efficient Exploration | 1 |
| Reinforcement Learning | 1 |
| Reinforcement Learning (RL) | 1 |
| reinforcement-learning | 1 |
Usage over time archive 2025-07-28
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
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