<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2306.17563/</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/2306.17563/feed.xml" rel="self" type="application/rss+xml" /><item><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting — mentioned by anishathalye</title><link>https://news.ycombinator.com/item?id=45250441</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.17563:45250441</guid><pubDate>Mon, 15 Sep 2025 14:55:29 GMT</pubDate><description>&lt;p&gt;That was a small self-contained example that fit above the fold in the README (and fwiw even last year’s models like GPT-4o give the right output there). That `sort` is based on pairwise comparisons, which is one of the best ways you can do it in terms of accuracy (Qin et al., 2023: https://arxiv.org/abs/2306.17563). I think there are many real use cases where you might want a semantic sort / semantic data processing in general, when there isn’t a deterministic way to do the task and there is not necessarily a single right answer, and some amount of error (due to LLMs being imperfect) is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.17563/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting — mentioned by markbergz</title><link>https://news.ycombinator.com/item?id=43325828</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.17563:43325828</guid><pubDate>Mon, 10 Mar 2025 20:40:25 GMT</pubDate><description>&lt;p&gt;For anyone interested in these LLM pairwise sorting problems, check out this paper: https://arxiv.org/abs/2306.17563 The authors discuss the person 1 / doc 1 bias and the need to always evaluate each pair of items twice. If you want to play around with this method there is a nice python tool here: https://github.com/vagos/llm-sort&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.17563/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting — mentioned by vagozino</title><link>https://news.ycombinator.com/item?id=43039484</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.17563:43039484</guid><pubDate>Thu, 13 Feb 2025 18:35:38 GMT</pubDate><description>&lt;p&gt;This technique might be more efficient but can be highly correlated to the order of the input text. The paper [1] I mention in the repo touches upon such methods briefly. [1]: https://arxiv.org/abs/2306.17563&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.17563/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting — mentioned by dollo_7</title><link>https://news.ycombinator.com/item?id=40033092</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.17563:40033092</guid><pubDate>Sun, 14 Apr 2024 18:11:51 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m not sure if that is a metric you can rely on. LLMs are very sensitive to the position of your item lists along the context, paying extra attention at the beginning and the end of those list. See the listwise approach at &amp;quot;Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting&amp;quot;, https://arxiv.org/abs/2306.17563&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.17563/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item><item><title>Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting — HN submission</title><link>https://news.ycombinator.com/item?id=36640564</link><guid isPermaLink="false">urn:hackerpapers:submission:2306.17563:36640564</guid><pubDate>Sat, 08 Jul 2023 01:47:34 GMT</pubDate><description>&lt;p&gt;Large Language Models Are Effective Text Rankers with Pairwise Ranking Prompting&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2306.17563/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
