<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Higher-Order Programs without Meta-Interpretive Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.14603/</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/2112.14603/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Higher-Order Programs without Meta-Interpretive Learning — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=32269050</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.14603:32269050</guid><pubDate>Thu, 28 Jul 2022 19:26:01 GMT</pubDate><description>&lt;p&gt;When I see a title with &amp;quot;toward[s]&amp;quot; in it, the first thing I wonder about is: why &amp;quot;toward[s]&amp;quot;? Why aren&amp;#x27;t we there yet? Scrolling down to &amp;quot;Performance Results&amp;quot; it&amp;#x27;s obvious that the results of this approach are creeping upwards at a snail&amp;#x27;s pace. 40% correct programs when the model is given 1000 &amp;quot;guesses&amp;quot; (one thousand) is the best result out of all reported results. It&amp;#x27;s the result for the simplest, &amp;quot;intro&amp;quot;-level, problems. Fromt here, results get progressively worse for harder categories, like harder problem sets or &amp;quot;1@k&amp;quot; measurements, where the first program generated by a model is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.14603/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
