<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Reward-Conditioned Policies · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1912.13465/</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/1912.13465/feed.xml" rel="self" type="application/rss+xml" /><item><title>Reward-Conditioned Policies — mentioned by tastroder</title><link>https://news.ycombinator.com/item?id=24773918</link><guid isPermaLink="false">urn:hackerpapers:mention:1912.13465:24773918</guid><pubDate>Wed, 14 Oct 2020 07:00:21 GMT</pubDate><description>&lt;p&gt;They mention Rainbow in the related work section of the third paper listed there, Kumar, A., Peng, X. B., &amp;amp; Levine, S. (2019). Reward-Conditioned Policies. arXiv:1912.13465 as part of this remark: &amp;quot;they are also known to be notoriously challenging to use effectively, due to sensitivity to hyper parameters, high sample complexity, and a range of important and delicate implementation choices that have a large effect on performance [5, 6, 12, 15, 23, 24, 46].&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1912.13465/"&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>
