<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Distributional Perspective on Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1707.06887/</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/1707.06887/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Distributional Perspective on Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=17862597</link><guid isPermaLink="false">urn:hackerpapers:submission:1707.06887:17862597</guid><pubDate>Tue, 28 Aug 2018 20:33:16 GMT</pubDate><description>&lt;p&gt;A Distributional Perspective on Reinforcement Learning&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/1707.06887/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>A Distributional Perspective on Reinforcement Learning — mentioned by clickok</title><link>https://news.ycombinator.com/item?id=16778052</link><guid isPermaLink="false">urn:hackerpapers:mention:1707.06887:16778052</guid><pubDate>Fri, 06 Apr 2018 22:28:53 GMT</pubDate><description>&lt;p&gt;Yes. In particular, it&amp;#x27;s possible to learn the variance of the return using TD-methods with the same computational complexity as learning the expected value (the value function). See [0] for how to do it via the squared TD-error, or [1] for how to estimate it via the second moment of the return, and my own notes (soon to be published and expanded for my thesis) here [2]. It turns out that identifying states with high variance is a great way of locating model error-- most of the real-world environments are fairly deterministic, so states with high variance tend to be &amp;quot;aliased&amp;quot; combinations of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1707.06887/"&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>A Distributional Perspective on Reinforcement Learning — mentioned by backpropaganda</title><link>https://news.ycombinator.com/item?id=14879224</link><guid isPermaLink="false">urn:hackerpapers:mention:1707.06887:14879224</guid><pubDate>Sat, 29 Jul 2017 02:47:25 GMT</pubDate><description>&lt;p&gt;You can say RL is not hard when you manage to teach all aspects of the SOTA RL algorithm (https://arxiv.org/abs/1707.06887) to your class such that they are able to answer any question about it (not just implement it). Good luck teaching metric spaces to code monkeys. You guys are doing good work teaching tensorflow and algorithms/models researchers are coming up with, but are slapping those same researchers by disrespecting what they&amp;#x27;re working on now. Some humility would be wise.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1707.06887/"&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>
