{"url":"/method/noisynet-dueling","slug":"noisynet-dueling","name":"NoisyNet-Dueling","full_name":"NoisyNet-Dueling","full_name_withheld":false,"description_markdown":"**NoisyNet-Dueling** is a modification of a [Dueling Network](https://paperswithcode.com/method/dueling-network) that utilises noisy linear layers for exploration instead of $\\epsilon$-greedy exploration as in the original Dueling formulation.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Noisy Networks for Exploration","paper":"/paper/noisy-networks-for-exploration","first_author":"Meire Fortunato","n_authors":12,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/noisy-networks-for-exploration"},"source":{"url":"https://arxiv.org/abs/1706.10295v3","title":"Noisy Networks for Exploration","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Q-Learning Networks","url":"/methods/category/q-learning-networks","pwc_aliases":["q-learning"]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/noisy-networks-for-exploration","title":"Noisy Networks for Exploration","date":"2017-06-30","arxiv_id":"1706.10295","n_code_links":15,"syntology":{"ran":1,"of":3,"unverified":2,"pointer_only":3}}],"papers_shown":1,"tasks":[{"task":"/task/atari-games","name":"Atari Games","papers":1},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/efficient-exploration","name":"Efficient Exploration","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":1}],"tasks_shown":6,"n_tasks":6,"usage_by_year":[{"year":"2017","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/noisynet-dueling"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}