<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Exploration by Random Network Distillation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1810.12894/</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/1810.12894/feed.xml" rel="self" type="application/rss+xml" /><item><title>Exploration by Random Network Distillation — mentioned by adroniser</title><link>https://news.ycombinator.com/item?id=41215107</link><guid isPermaLink="false">urn:hackerpapers:mention:1810.12894:41215107</guid><pubDate>Sun, 11 Aug 2024 09:56:54 GMT</pubDate><description>&lt;p&gt;But RL algorithms do implement things like curiosity to drive exploration?? https://arxiv.org/pdf/1810.12894. Thinking to arbitrary depth sounds like Monte Carlo tree search? Which is often implemented in conjunction with RL. And working memory I think is a matter of the architecture you use in conjunction with RL, agree that transformers aren&amp;#x27;t very helpful for this. I think what you call &amp;#x27;trial and error&amp;#x27;, is what I intuitively think of RL as doing. AlphaProof runs an RL algorithm during training, AND at inference time. When given an olympiad problem, it generates many variations on that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1810.12894/"&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>Exploration by Random Network Distillation — HN submission</title><link>https://news.ycombinator.com/item?id=19134898</link><guid isPermaLink="false">urn:hackerpapers:submission:1810.12894:19134898</guid><pubDate>Mon, 11 Feb 2019 15:03:47 GMT</pubDate><description>&lt;p&gt;Exploration by Random Network Distillation (2018)&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/1810.12894/"&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>
