<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1704.07926/</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/1704.07926/feed.xml" rel="self" type="application/rss+xml" /><item><title>From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood — mentioned by ke1vin</title><link>https://news.ycombinator.com/item?id=14381315</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.07926:14381315</guid><pubDate>Sat, 20 May 2017 06:43:29 GMT</pubDate><description>&lt;p&gt;When you only provide the system with a few examples, there are many possible transformations which satisfy the examples. One way to eliminate this ambiguity is to also provide a natural language description of what you want, e.g. &amp;quot;remove the spaces&amp;quot;. In the natural language processing community, we call this semantic parsing. But sometimes the semantic parser can misinterpret the language too and generate a program which still &amp;quot;cheats&amp;quot; in the same manner as you described. We call these &amp;quot;spurious programs&amp;quot;. Shameless plug-- my group has been working on how to deal with these spurious…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.07926/"&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>
