<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep Reinforcement Learning with Double Q-learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1509.06461/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1509.06461/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deep Reinforcement Learning with Double Q-learning — mentioned by DevelopingElk</title><link>https://news.ycombinator.com/item?id=44280729</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.06461:44280729</guid><pubDate>Sun, 15 Jun 2025 05:26:02 GMT</pubDate><description>&lt;p&gt;I think the article&amp;#x27;s analysis of overapproximation bias is correct. The issue is that due to the Max operator in the Q learning noise is amplified over timesteps. Some methods to reduce this bias, such as https://arxiv.org/abs/1509.06461 were successful in improving the RL agents performance. Studies have found that this happens even more for the states that the network hasn&amp;#x27;t visited many times. An exponential number of states only matters if there is no pattern to them. If there is some structure that the network can learn then it can perform well. This is a strength of deep learning, not…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.06461/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Deep Reinforcement Learning with Double Q-learning — mentioned by ClintEhrlich</title><link>https://news.ycombinator.com/item?id=10272242</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.06461:10272242</guid><pubDate>Thu, 24 Sep 2015 15:44:27 GMT</pubDate><description>&lt;p&gt;Here is a link to the underlying study, for people who are interested in digging into the data themselves: http://arxiv.org/pdf/1509.06461v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.06461/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Deep Reinforcement Learning with Double Q-learning — HN submission</title><link>https://news.ycombinator.com/item?id=10268492</link><guid isPermaLink="false">urn:hackerpapers:submission:1509.06461:10268492</guid><pubDate>Wed, 23 Sep 2015 21:49:22 GMT</pubDate><description>&lt;p&gt;DeepMind: Deep Reinforcement Learning with Double Q Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1509.06461/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
