<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TerpreT: A Probabilistic Programming Language for Program Induction · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1608.04428/</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/1608.04428/feed.xml" rel="self" type="application/rss+xml" /><item><title>TerpreT: A Probabilistic Programming Language for Program Induction — mentioned by justinnk</title><link>https://news.ycombinator.com/item?id=40484793</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04428:40484793</guid><pubDate>Sun, 26 May 2024 19:46:01 GMT</pubDate><description>&lt;p&gt;Thanks! You may find DeepProbLog by Manhaeve et al. interesting, which brings together logic programming, probabilistic programming and gradient descent/neural networks. Also, more generally, I believe in the field of program synthesis there is some research on deriving programs with gradient descent. However, as also pointed out in the comment below, gradient descent may not always be the best approach to such problems (e.g., https://arxiv.org/abs/1608.04428).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04428/"&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>TerpreT: A Probabilistic Programming Language for Program Induction — mentioned by mabrocks</title><link>https://news.ycombinator.com/item?id=31679229</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04428:31679229</guid><pubDate>Thu, 09 Jun 2022 09:30:29 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re interested in these kinds of things, many years ago we created TerpreT (https://arxiv.org/pdf/1608.04428.pdf and https://github.com/51alg/TerpreT) to look into generic program synthesis problems, using a set of very different techniques (gradient descent, ILP, SMT) on different problem settings (turing machines, boolean circuits, LLVM IR-style basic blocks, and straight assembly).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04428/"&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>TerpreT: A Probabilistic Programming Language for Program Induction — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=28709923</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04428:28709923</guid><pubDate>Thu, 30 Sep 2021 19:01:00 GMT</pubDate><description>&lt;p&gt;There is a vast chasm of computational complexity between Chess, Go, and protein folding, to program induction. Unlike problems where the configuration space grows exponentially, the space of valid programs is at least super-exponential and depending on the language family, (e.g. context free, context sensitive, recursively enumerable), can often be undecidable. Furthermore, many language induction problems do not have optimal substructure or overlapping subproblems, two important prerequisites for reinforcement learning to work. In these settings, gradient-based heuristics will only get you…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04428/"&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>TerpreT: A Probabilistic Programming Language for Program Induction — mentioned by rapidcheckout</title><link>https://news.ycombinator.com/item?id=16096872</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04428:16096872</guid><pubDate>Mon, 08 Jan 2018 14:24:50 GMT</pubDate><description>&lt;p&gt;&amp;gt; What sort of things have been achieved with machine-learning over algorithms, though? See also this paper for a comparison of programming by example using gradient descent versus more standard alternatives: https://arxiv.org/abs/1608.04428 The main takeaway is that gradient descent is not a silver bullet for searching over program space.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04428/"&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>TerpreT: A Probabilistic Programming Language for Program Induction — HN submission</title><link>https://news.ycombinator.com/item?id=12303188</link><guid isPermaLink="false">urn:hackerpapers:submission:1608.04428:12303188</guid><pubDate>Wed, 17 Aug 2016 08:30:29 GMT</pubDate><description>&lt;p&gt;TerpreT: A Probabilistic Programming Language for Program Induction by MSR&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/1608.04428/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
