<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Correct and Optimal: the Regular Expression Inference Challenge · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2308.07899/</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/2308.07899/feed.xml" rel="self" type="application/rss+xml" /><item><title>Correct and Optimal: the Regular Expression Inference Challenge — mentioned by reic</title><link>https://news.ycombinator.com/item?id=37549681</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.07899:37549681</guid><pubDate>Sun, 17 Sep 2023 21:49:14 GMT</pubDate><description>&lt;p&gt;Quantification can be done by measuring in at least two dimensions: (1) the size of the synthesised code, and (2) how precisely the generated code matches the input (which means roughly: on what fraction of input do the two programs give different output). We have set up a challenge that seeks to entice the community to look into this problem domain more. And we&amp;#x27;ve simplified the assumptions, so as to make it more tractable: - Challenge: https://codalab.lisn.upsaclay.fr/competitions/15096 - Paper describing the challenge: https://arxiv.org/abs/2308.07899 (I am one of the authors, AMA)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.07899/"&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>
