<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Relational inductive biases, deep learning, and graph networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1806.01261/</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.01261/feed.xml" rel="self" type="application/rss+xml" /><item><title>Relational inductive biases, deep learning, and graph networks — HN submission</title><link>https://news.ycombinator.com/item?id=42481001</link><guid isPermaLink="false">urn:hackerpapers:submission:1806.01261:42481001</guid><pubDate>Sat, 21 Dec 2024 17:40:32 GMT</pubDate><description>&lt;p&gt;Relational inductive biases, deep learning, and graph networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1806.01261/"&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>Relational inductive biases, deep learning, and graph networks — mentioned by taliesinb</title><link>https://news.ycombinator.com/item?id=20729359</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01261: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.01261/"&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 inductive biases, deep learning, and graph networks — HN submission</title><link>https://news.ycombinator.com/item?id=18263670</link><guid isPermaLink="false">urn:hackerpapers:submission:1806.01261:18263670</guid><pubDate>Sat, 20 Oct 2018 15:25:26 GMT</pubDate><description>&lt;p&gt;Relational inductive biases, deep learning, and graph networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;45 points; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1806.01261/"&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>Relational inductive biases, deep learning, and graph networks — mentioned by mlthrowaway1953</title><link>https://news.ycombinator.com/item?id=17663622</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01261:17663622</guid><pubDate>Wed, 01 Aug 2018 15:51:04 GMT</pubDate><description>&lt;p&gt;Is the Fields Medal going to still be relevant in 10 years, when most of the the major mathematical discoveries are made by deep learning and deep reinforcement learning systems? Already systems are learning to reason about concepts [1] and of course there is classical work on proof checkers [2]. It&amp;#x27;s very likely that the 2028 Fields medal will be awarded to a programmer, not some mathematical super-genius (assuming that the committee is fair, and not biased against machines). [1] https://arxiv.org/abs/1806.01261 [2] https://en.wikipedia.org/wiki/Four_color_theorem&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1806.01261/"&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 inductive biases, deep learning, and graph networks — mentioned by blueyes</title><link>https://news.ycombinator.com/item?id=17267141</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01261:17267141</guid><pubDate>Fri, 08 Jun 2018 16:38:18 GMT</pubDate><description>&lt;p&gt;Chatbots proposed to solve a problem that current technology is bad at: understanding natural language. Very few experts claimed that algorithms could master the combinatorics of natural language beyond a few very narrow domains. On top of the technical risk, the voice and chat UX does not give a lot of visibility to users, as this post points out. What happened was: algorithmic advances in other areas lead to analogous reasoning by non-experts whose self-promotion aligned with the media&amp;#x27;s need for something new, big and understandable. And then it failed. The irony, of course, is that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1806.01261/"&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>
