<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Curiosity Killed or Incapacitated the Cat and the Asymptotically Optimal Agent · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.03357/</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/2006.03357/feed.xml" rel="self" type="application/rss+xml" /><item><title>Curiosity Killed or Incapacitated the Cat and the Asymptotically Optimal Agent — mentioned by measurablefunc</title><link>https://news.ycombinator.com/item?id=47008501</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.03357:47008501</guid><pubDate>Fri, 13 Feb 2026 22:09:24 GMT</pubDate><description>&lt;p&gt;That doesn&amp;#x27;t address what I asked. The paper I linked proves undecidability for a much larger class of problems* which includes the case you&amp;#x27;re talking about of asymptotic optimality. In any case, I am certain you are unfamiliar w/ what I linked b/c I was also unaware of it until recently &amp;amp; was convinced by the standard arguments people use to convince themselves they can solve any &amp;amp; all problems w/ the proper policy optimization algorithm. Moreover, there is also the problem of catastrophic state avoidance even for asymptotically optimal agents: https://arxiv.org/abs/2006.03357v2. *…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.03357/"&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>Curiosity Killed or Incapacitated the Cat and the Asymptotically Optimal Agent — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=31360167</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.03357:31360167</guid><pubDate>Thu, 12 May 2022 21:11:45 GMT</pubDate><description>&lt;p&gt;&amp;gt; Methodologically, how do we create agents that aren&amp;#x27;t just good at several tasks, but make up their own tasks It&amp;#x27;s a good question, it has been asked a few times, and there are some answers[1][2] already, with the most general being to endow the agent with intrinsic motivation defined as an information-theoretic objective to maximize some definition of surprise. Then the agent in question will develop a general curious exploration policy, if trained long enough. &amp;gt; Further, how do we create agents that can learn without ever seriously failing? Another good question. One of the good enough…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.03357/"&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>Curiosity Killed or Incapacitated the Cat and the Asymptotically Optimal Agent — HN submission</title><link>https://news.ycombinator.com/item?id=23577832</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.03357:23577832</guid><pubDate>Fri, 19 Jun 2020 19:07:08 GMT</pubDate><description>&lt;p&gt;Curiosity Killed the Cat and the Asymptotically Optimal Agent&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.03357/"&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>
