<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Asynchronous Methods for Deep Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1602.01783/</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/1602.01783/feed.xml" rel="self" type="application/rss+xml" /><item><title>Asynchronous Methods for Deep Reinforcement Learning — mentioned by dsptri</title><link>https://news.ycombinator.com/item?id=15921319</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:15921319</guid><pubDate>Thu, 14 Dec 2017 10:51:23 GMT</pubDate><description>&lt;p&gt;Playing the games simultaneously is actually innovative in how it let&amp;#x27;s them learn faster. If you play one game at a time consecutive moves are highly correlated which makes it difficult to make learning updates after each move. If you&amp;#x27;re playing 1250 parallel games that are starting and restarting so that they&amp;#x27;re at all at different stages of play, you can do an update after every move in every game and make better progress faster. This is known as Asynchronous Advantage Actor-Critic (A3C) and is a highly cited method discovered by the DeepMind team [1]. [1] https://arxiv.org/abs/1602.01783&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by shpx</title><link>https://news.ycombinator.com/item?id=13963950</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:13963950</guid><pubDate>Sun, 26 Mar 2017 23:21:38 GMT</pubDate><description>&lt;p&gt;&amp;gt; we were able to solve one of the hardest MuJoCo tasks (a 3D humanoid) using 1,440 CPUs across 80 machines in only 10 minutes. As a comparison, in a typical setting 32 A3C workers on one machine would solve this task in about 10 hours. So using 80 times more machines makes you 60 times faster (assuming those are the same machines) &amp;quot;while performing better on 23 games tested, and worse on 28&amp;quot;[0]? [0] The paper for this blog post https://arxiv.org/pdf/1703.03864.pdf Asynchronous advantage actor critic (A3C) https://arxiv.org/pdf/1602.01783.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by Hydraulix989</title><link>https://news.ycombinator.com/item?id=13103892</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:13103892</guid><pubDate>Mon, 05 Dec 2016 07:19:28 GMT</pubDate><description>&lt;p&gt;What is state of the art in reinforcement learning right now? https://arxiv.org/abs/1602.01783 Is there a way to deal with &amp;quot;sparse&amp;quot; training data (state, action, reward) triples -- sparse in &amp;quot;state&amp;quot;?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by macromaniac</title><link>https://news.ycombinator.com/item?id=12486300</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:12486300</guid><pubDate>Tue, 13 Sep 2016 07:51:19 GMT</pubDate><description>&lt;p&gt;There was a paper a few months back in deep reinforcement learning that got record setting RL results using only a CPU [0]. Previously, these algorithms would play fewer games and run a gpu over and over on the few games they had played. By using a CPU you can generate more samples that are up to date with your learning algorithm. It sounds obvious in hindsight, but you can&amp;#x27;t exactly run 60 atari sims on a gpu. [0] - https://arxiv.org/abs/1602.01783&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by blueeyes44</title><link>https://news.ycombinator.com/item?id=12360909</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:12360909</guid><pubDate>Thu, 25 Aug 2016 17:39:11 GMT</pubDate><description>&lt;p&gt;Couple key points: This project[0] is going to keep developing. It has Deep Q Learning now, A3C[1] is working and more features are being added. Just as important: RL4J and DL4J run on a scientific computing framework called ND4J[2] that integrates with Spark and trains on multiple GPUs.[3][4] It&amp;#x27;s basically porting RL to the production stack of large organizations that work with the JVM and need to scale. The key thing to remember is that RL combines with other algorithms, like deep convolutional nets or Monte Carlo Search Trees. DL4J has the ConvNets already.[5] [0]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=11959401</link><guid isPermaLink="false">urn:hackerpapers:submission:1602.01783:11959401</guid><pubDate>Thu, 23 Jun 2016 07:28:53 GMT</pubDate><description>&lt;p&gt;Google DeepMind: Asynchronous Methods for Deep Reinforcement 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/1602.01783/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Asynchronous Methods for Deep Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=11906919</link><guid isPermaLink="false">urn:hackerpapers:submission:1602.01783:11906919</guid><pubDate>Wed, 15 Jun 2016 02:54:18 GMT</pubDate><description>&lt;p&gt;Asynchronous Methods for Deep Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Asynchronous Methods for Deep Reinforcement Learning — mentioned by chris_va</title><link>https://news.ycombinator.com/item?id=11877287</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:11877287</guid><pubDate>Fri, 10 Jun 2016 15:57:06 GMT</pubDate><description>&lt;p&gt;Highlights: 1) No GPUs necessary, gives similar/better results in similar time (see http://arxiv.org/pdf/1602.01783v1.pdf) 2) 1-step Q (according to paper, maybe could do better with actor-critic + 1 LSTM layer) 3) Keras is really only used for a tiny fraction of the code. Which means that there is a lot of boilerplate that could be rolled up into a shared library still.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by Kristine1975</title><link>https://news.ycombinator.com/item?id=11548186</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:11548186</guid><pubDate>Fri, 22 Apr 2016 10:33:10 GMT</pubDate><description>&lt;p&gt;Related: https://www.newscientist.com/article/2076552-google-deepmind... Google DeepMind AI navigates a Doom-like 3D maze just by looking Paper: http://arxiv.org/abs/1602.01783&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by sapphireblue</title><link>https://news.ycombinator.com/item?id=11489735</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:11489735</guid><pubDate>Wed, 13 Apr 2016 16:36:08 GMT</pubDate><description>&lt;p&gt;The progress in machine learning/deep learning for last 5 years has been literally staggering. Read about new state of art results. There is already superhuman visual object recognition, voice recognition, good machine translation, description of scenes in natural language, question answering (facebook babi dataset), visual question answering, algorithm learning (neural turing machines, neural GPUs), and finally really strong reinforcement learning (deepmind&amp;#x27;s DQN, A3C algorithms). The last one, reinforcement learning, is really important because it&amp;#x27;s a basis for general intelligence. By…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — mentioned by ogrisel</title><link>https://news.ycombinator.com/item?id=11255514</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:11255514</guid><pubDate>Wed, 09 Mar 2016 20:28:09 GMT</pubDate><description>&lt;p&gt;see also by the same team: http://arxiv.org/abs/1602.01783&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=11052886</link><guid isPermaLink="false">urn:hackerpapers:submission:1602.01783:11052886</guid><pubDate>Sun, 07 Feb 2016 14:15:51 GMT</pubDate><description>&lt;p&gt;Asynchronous Methods for Deep Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Asynchronous Methods for Deep Reinforcement Learning — mentioned by wickedgain</title><link>https://news.ycombinator.com/item?id=11047114</link><guid isPermaLink="false">urn:hackerpapers:mention:1602.01783:11047114</guid><pubDate>Sat, 06 Feb 2016 09:27:24 GMT</pubDate><description>&lt;p&gt;Link to paper: http://arxiv.org/abs/1602.01783&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>Asynchronous Methods for Deep Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=11045343</link><guid isPermaLink="false">urn:hackerpapers:submission:1602.01783:11045343</guid><pubDate>Fri, 05 Feb 2016 23:03:04 GMT</pubDate><description>&lt;p&gt;Deepmind Navigates 3D Maze WithAsynchronous Methods 4 Deep Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;11 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1602.01783/"&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>
