<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Relational Deep Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1806.01830/</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/1806.01830/feed.xml" rel="self" type="application/rss+xml" /><item><title>Relational Deep Reinforcement Learning — mentioned by taliesinb</title><link>https://news.ycombinator.com/item?id=20729359</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01830:20729359</guid><pubDate>Sun, 18 Aug 2019 10:17:40 GMT</pubDate><description>&lt;p&gt;Hasselt and co, who authored the original Rainbow DQN model that was bested by SimPLe (this paper), responded recently with &amp;quot;When to use parametric models in reinforcement learning?&amp;quot; [1], which is an interesting read. Punchline: &amp;quot;We explain why their [SimPLe&amp;#x27;s] results may perhaps be considered surprising, and show that in a like-for-like comparison Rainbow DQN outperformed the scores of the model-based agent, with less experience and computation.&amp;quot;. In other words, in an apples-to-apples comparison, model-based RL have not been shown to be more sample efficient than suitably optimized DQNs.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1806.01830/"&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>Relational Deep Reinforcement Learning — mentioned by yonkshi</title><link>https://news.ycombinator.com/item?id=18749943</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01830:18749943</guid><pubDate>Mon, 24 Dec 2018 02:50:23 GMT</pubDate><description>&lt;p&gt;Sure. I don&amp;#x27;t have any holistic survey to prove my point, but an example of recent progress in terms of sample efficiency is this paper[0]. Derivatives of this paper have been used to solve Sudoku[1], Starcraft II[2] and more [3]. This paper enabled more efficient use of data by creating a probabilistic graphical model between logical sets. [0]https://arxiv.org/abs/1706.01427 [1]https://arxiv.org/abs/1711.08028 [2]https://arxiv.org/abs/1806.01830 [3]https://arxiv.org/abs/1806.01822&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1806.01830/"&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>
