<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Explanatory Rules from Noisy Data · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1711.04574/</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/1711.04574/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=28504085</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:28504085</guid><pubDate>Sun, 12 Sep 2021 19:29:03 GMT</pubDate><description>&lt;p&gt;You&amp;#x27;re not too far off. The big advantage of ILP with respect to statistical techniques is the really extraordinary sample efficiency. Just a couple of examples are enough to learn many programs [1]. Moreover, ILP is pretty much the only machine learning approach that can make use of background knowledge [2] and in fact is characterised by this ability, and it is the ability to use background knowledge that is responsible for the excellent sample complexity, because if you don&amp;#x27;t have any background knowledge you are forced to learn everything from scratch - as in the &amp;quot;end-to-end&amp;quot; approach…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=25054132</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:25054132</guid><pubDate>Wed, 11 Nov 2020 00:35:10 GMT</pubDate><description>&lt;p&gt;Aren&amp;#x27;t you shifting the goalposts a bit? First you ask me how I&amp;#x27;d solve this problem with ILP: “Given three strings n1, n2, and n3, return true if length(n1) &amp;lt; length(n2) &amp;lt; length(n3), and false otherwise” (a) I say this is a trivial problem to solve with ILP and I show you a, well, trivial solution and you complain that it&amp;#x27;s - trivial. Then I show you a more elaborate version that learns sub-programs on the way to the full solution and you say that a) it doesn&amp;#x27;t solve a different problem, with ≤ instead of &amp;lt; and b) that it&amp;#x27;s not trivial anymore. And now you&amp;#x27;re saying you want a solution that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by sanxiyn</title><link>https://news.ycombinator.com/item?id=20091925</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:20091925</guid><pubDate>Tue, 04 Jun 2019 04:37:33 GMT</pubDate><description>&lt;p&gt;Inductive Logic Programming. DeepMind work in question is https://arxiv.org/abs/1711.04574.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=20080915</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:20080915</guid><pubDate>Mon, 03 Jun 2019 06:40:40 GMT</pubDate><description>&lt;p&gt;Hi. ILP is Inductive Logic Programming, a form of logic-based, symbolic machine learning. ILP &amp;quot;models&amp;quot; are first-order logic theories that are not differentiable. To put it plainly, most ILP algorithms learn Prolog programs from examples and background knowledge which are also Prolog programs. Some learn logic programs in other logic programming languages, like Answer Set Programming or constraint programming languages. The wikipedia page on ILP has a good general introduction: https://en.wikipedia.org/wiki/Inductive_logic_programming The most recent survey article I know of is the following…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=18971576</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:18971576</guid><pubDate>Tue, 22 Jan 2019 19:34:38 GMT</pubDate><description>&lt;p&gt;Ah, but this is the great thing about ILP, including the δILP system in the article- that the &amp;quot;models&amp;quot; are actually logical theories that can be directly inspected (by reading them!) and verified. So we don&amp;#x27;t have to wonder whether the model learned by the algorithm will generalise outside its training data- we can just check the learned theory. This is one of the theories learned by the δILP system for the less-than relation between images of numbers, taken from the pdf version of the paper [1]. Using Prolog as the notation (the transformation from the article is trivial): target…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=18925833</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:18925833</guid><pubDate>Wed, 16 Jan 2019 21:56:21 GMT</pubDate><description>&lt;p&gt;Btw, if you have relational data and a few good people with strong computer science backgrounds rather than statisticians or mathematicians, have a look at Inductive Logic Programming. ILP is a set of machine learning techniques that learn logic programs from logic programs. The sample efficiency is on a class of its own and it generalises robustly from very little data[1]. I study ILP algorithms for my PhD. My research group has recently developed a new technique, Meta Interpretive Learning. Its canonical implementation is Metagol: https://github.com/metagol/metagol Please feel free to email…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by omeze</title><link>https://news.ycombinator.com/item?id=18578283</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:18578283</guid><pubDate>Sat, 01 Dec 2018 19:06:17 GMT</pubDate><description>&lt;p&gt;Its a long article but he’s advocating for a hybrid approach to deal with problems that DNNs encounter today which he believes are fundamental to DNNs (reasoning, causality). An example of such an approach taken with success is given at the end: https://arxiv.org/pdf/1711.04574.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=17837055</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:17837055</guid><pubDate>Fri, 24 Aug 2018 18:58:37 GMT</pubDate><description>&lt;p&gt;Actually, I wasn&amp;#x27;t thinking of any specific methods, but now that you mentioned it, Inductive Logic Progamming (the subject of my PhD - see my comment about being biased) is a fine example. For a slightly more impartial opinion, here&amp;#x27;s a DeepMind paper that performs neural ILP: https://deepmind.com/blog/learning-explanatory-rules-noisy-d... The authors begin by extolling the virtues of ILP, including its generalisation abilities, as follows: Second, ILP systems tend to be impressively data-efficient, able to generalise well from a small handful of examples. [1] You can find more references to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=17318549</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.04574:17318549</guid><pubDate>Fri, 15 Jun 2018 09:37:25 GMT</pubDate><description>&lt;p&gt;Has there been a misunderstanding of my comment? I didn&amp;#x27;t mean to say that I expect &amp;quot;AI to go away&amp;quot;. For one thing, I certainly do not equate all of AI to deep learning, or even machine learning. My point is that deep learning has generated a lot of excitement in the last few years, but as we&amp;#x27;re hitting inevitable diminishing returns the excitement is dying down and people are starting to think about how to move beyond current techniques. As usual, the last to catch on to the reversal of the old trend, or the new trend if you prefer, are the people who pay the money- industry investors or the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — HN submission</title><link>https://news.ycombinator.com/item?id=16394999</link><guid isPermaLink="false">urn:hackerpapers:submission:1711.04574:16394999</guid><pubDate>Fri, 16 Feb 2018 19:12:18 GMT</pubDate><description>&lt;p&gt;Learning Explanatory Rules from Noisy Data [with Neural Networks]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning Explanatory Rules from Noisy Data — HN submission</title><link>https://news.ycombinator.com/item?id=15704861</link><guid isPermaLink="false">urn:hackerpapers:submission:1711.04574:15704861</guid><pubDate>Wed, 15 Nov 2017 16:21:56 GMT</pubDate><description>&lt;p&gt;Learning Explanatory Rules from Noisy Data [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1711.04574/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
