<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1509.08731/</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/1509.08731/feed.xml" rel="self" type="application/rss+xml" /><item><title>Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning — mentioned by kastnerkyle</title><link>https://news.ycombinator.com/item?id=11863497</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.08731:11863497</guid><pubDate>Wed, 08 Jun 2016 16:37:01 GMT</pubDate><description>&lt;p&gt;Montezuma&amp;#x27;s Revenge, Castle Wolfenstein (not the shooter), and puzzle games in general have a problem of long term credit assignment and sparse reward. This &amp;quot;intrinsic reward&amp;quot; approach form the paper, based on pseudo counts seems to be one way to get an intermediate reward which helps the model learn toward an overall goal (winning/progress) which happens rarely. The previous best work had to pre-define the intrinsic rewards as I understand it [0], and DeepMind has been tracking this general problem for a while [1] along with a whole bunch of earlier work from the 70s/80s/90s (cited in the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.08731/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning — mentioned by ogrisel</title><link>https://news.ycombinator.com/item?id=10807311</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.08731:10807311</guid><pubDate>Tue, 29 Dec 2015 16:10:29 GMT</pubDate><description>&lt;p&gt;The utility function can be specified in a way to build up something that looks like an internal motivation system. This is often referred to as intrinsically motivated reinforcement learning. A recent paper by 2 Google Deepmind researchers on this topic: Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning Shakir Mohamed and Danilo J. Rezende http://arxiv.org/abs/1509.08731 and a somewhat older survey paper on the same topic: How can we define intrinsic motivation? Pierre-Yves Oudeyer, Frederic Kaplan http://www.pyoudeyer.com/epirob08OudeyerKaplan.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.08731/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning — mentioned by davmre</title><link>https://news.ycombinator.com/item?id=10436094</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.08731:10436094</guid><pubDate>Fri, 23 Oct 2015 00:24:46 GMT</pubDate><description>&lt;p&gt;The point is that supervised training on large networks requires millions or billions of examples. In RL, that means potentially billions of execution trajectories, which can be really expensive if you&amp;#x27;re executing on an actual, physical robot. And even then, supervised classification objectives are more informative than just a scalar reward: when a supervised system makes a wrong prediction you don&amp;#x27;t just tell it &amp;quot;sorry, that&amp;#x27;s wrong&amp;quot;, you also tell it what the right prediction would have been. That extra information is really valuable for learning. In the black-box RL setting, you only see…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.08731/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
