<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Comparison of Contextual and Non-Contextual Preference Ranking for Set Addition Problems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.04438/</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/2107.04438/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Comparison of Contextual and Non-Contextual Preference Ranking for Set Addition Problems — mentioned by danbrooks</title><link>https://news.ycombinator.com/item?id=38534746</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.04438:38534746</guid><pubDate>Tue, 05 Dec 2023 18:13:34 GMT</pubDate><description>&lt;p&gt;Super interesting that drafts can be represented with LLMs. The best performing draft AI&amp;#x27;s I&amp;#x27;ve seen leverage representation learning in some form. See: https://arxiv.org/pdf/2107.04438.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.04438/"&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>
