<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Go-Explore: a New Approach for Hard-Exploration Problems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1901.10995/</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/1901.10995/feed.xml" rel="self" type="application/rss+xml" /><item><title>Go-Explore: a New Approach for Hard-Exploration Problems — mentioned by kywch</title><link>https://news.ycombinator.com/item?id=46449706</link><guid isPermaLink="false">urn:hackerpapers:mention:1901.10995:46449706</guid><pubDate>Thu, 01 Jan 2026 00:04:39 GMT</pubDate><description>&lt;p&gt;I think Go-Explore (https://arxiv.org/abs/1901.10995) is promising. It&amp;#x27;ll provide automatic scaffolding and prevent catastrophic forgetting. If one can frame the problem into a competition, then self-play has been shown to work repeatedly.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1901.10995/"&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>Go-Explore: a New Approach for Hard-Exploration Problems — mentioned by FlyingSaucer</title><link>https://news.ycombinator.com/item?id=25645006</link><guid isPermaLink="false">urn:hackerpapers:mention:1901.10995:25645006</guid><pubDate>Tue, 05 Jan 2021 12:57:28 GMT</pubDate><description>&lt;p&gt;This topic is extremely interesting, and good to see that experiments support it. In AI lens: In a way, you can compare this to novelty seeking and intelligent exploration which is quite an active field in Artificial Life and game AI[1]. If you find this interesting: Jeff Clune, Kenneth Stanley and Joel Lehman conducted interesting related research. Also, isn&amp;#x27;t this somehow related to the Free Energy principle by Karl Friston? If you look at entropy maximization as a way to minimize surprises. [1] : https://arxiv.org/abs/1901.10995&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1901.10995/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
