<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Simple random search provides a competitive approach to reinforcement learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1803.07055/</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/1803.07055/feed.xml" rel="self" type="application/rss+xml" /><item><title>Simple random search provides a competitive approach to reinforcement learning — mentioned by erwincoumans</title><link>https://news.ycombinator.com/item?id=31686331</link><guid isPermaLink="false">urn:hackerpapers:mention:1803.07055:31686331</guid><pubDate>Thu, 09 Jun 2022 20:25:06 GMT</pubDate><description>&lt;p&gt;Black box optimization such as CMA-ES or Augmented Random Search (ars) are used by researchers, for example: CMA-ES: https://blog.otoro.net/2017/10/29/visual-evolution-strategie... ARS: https://arxiv.org/abs/1803.07055 Those optimizers are efficient up to certain neural network sizes.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=20789159</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:20789159</guid><pubDate>Sat, 24 Aug 2019 19:26:08 GMT</pubDate><description>&lt;p&gt;Simple random search provides a competitive approach to reinforcement learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — mentioned by rademacher</title><link>https://news.ycombinator.com/item?id=18414305</link><guid isPermaLink="false">urn:hackerpapers:mention:1803.07055:18414305</guid><pubDate>Fri, 09 Nov 2018 13:54:18 GMT</pubDate><description>&lt;p&gt;DRL has definitely shown some excellent results but can someone in the field comment on this paper, Simple random search provides a competitive approach to reinforcement learning [1]. [1] https://arxiv.org/abs/1803.07055&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — mentioned by naturalgradient</title><link>https://news.ycombinator.com/item?id=17392700</link><guid isPermaLink="false">urn:hackerpapers:mention:1803.07055:17392700</guid><pubDate>Mon, 25 Jun 2018 14:33:31 GMT</pubDate><description>&lt;p&gt;So as someone working in reinforcement learning who has used PPO a fair bit, I find this quite disappointing from an algorithmic perspective. The resources used for this are almost absurd and my suspicion is, especially considering [0], that this comes down to an incredibly expensive random search in the policy space. Or rather, I would want to see a fair bit of analysis to be shown otherwise. Especially given all the work in intrinsic motivation, hierarchical learning, subtask learning, etc, the sort of intermediate summary of most of these papers from 2015-2018 is that so many of these…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=17389534</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:17389534</guid><pubDate>Mon, 25 Jun 2018 02:25:26 GMT</pubDate><description>&lt;p&gt;Simple random search provides a competitive approach to reinforcement learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=16831628</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:16831628</guid><pubDate>Fri, 13 Apr 2018 16:43:03 GMT</pubDate><description>&lt;p&gt;Simple random search provides a competitive approach to reinforcement learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=16635511</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:16635511</guid><pubDate>Wed, 21 Mar 2018 04:40:25 GMT</pubDate><description>&lt;p&gt;Simple Random Search provides a competitive approach to RL&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/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=16631674</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:16631674</guid><pubDate>Tue, 20 Mar 2018 19:19:25 GMT</pubDate><description>&lt;p&gt;Simple random search provides a competitive approach to 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/1803.07055/"&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>Simple random search provides a competitive approach to reinforcement learning — HN submission</title><link>https://news.ycombinator.com/item?id=16624908</link><guid isPermaLink="false">urn:hackerpapers:submission:1803.07055:16624908</guid><pubDate>Tue, 20 Mar 2018 00:45:58 GMT</pubDate><description>&lt;p&gt;Simple random search provides a competitive approach to reinforcement learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;8 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1803.07055/"&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>
