<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Discovery of Options via Meta-Learned Subgoals · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2102.06741/</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/2102.06741/feed.xml" rel="self" type="application/rss+xml" /><item><title>Discovery of Options via Meta-Learned Subgoals — mentioned by esac</title><link>https://news.ycombinator.com/item?id=27795164</link><guid isPermaLink="false">urn:hackerpapers:mention:2102.06741:27795164</guid><pubDate>Sat, 10 Jul 2021 17:53:11 GMT</pubDate><description>&lt;p&gt;&amp;gt;genetic algorithms combined with RL where the genetics determine the reward function. I have been working on this problem for years (2+ as researcher, 2 as PhD student). The main issue is that evolution is both massively parallel and had plenty of runtime to get to human level intelligence. The person that pushes this evolution/evolved reward point is Andrew G. Barto and his students/collaborators over the years. Satinder Singh in particular is actively working on gradient based algorithms to find rewards (e.g. https://arxiv.org/abs/2102.06741) &amp;gt; Maybe we need to frame RL goals in much more…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2102.06741/"&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>
