Found in the Middle: Permutation Self-Consistency Improves Listwise Ranking in Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Large language models exhibit positional bias in how they use context, which affects listwise ranking. |
| Approach: | They propose a method to marginalize out different list orders in the prompt to produce an order-independent ranking with less positional bias. |
| Outcome: | The proposed method improves on five datasets in sorting and passage reranking by 34-52% . it marginalizes out different list orders in the prompt to produce an order-independent ranking . |
Similar Papers
Beyond Sampling: Self-Sorting for Long-Context Ranking (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) remain unstable on long-context ranking. |
| Approach: | They propose a method that fuses explicit within-list positions with implicit cross-list preferences to score entities and return a top-k set. |
| Outcome: | Experimental results show that large language models remain unstable on long-context ranking . |
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)
Copied to clipboard
Meixiu Long, Duolin Sun, Dan Yang, Yihan Jiao, Lei Liu, Jiahai Wang, Binbin Hu, Yue Shen, Jie Feng, Zhehao Tan, Junjie Wang, Lianzhen Zhong, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
FIRST: Faster Improved Listwise Reranking with Single Token Decoding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing listwise LLMs lack efficiency as they provide ranking output in the form of a generated ordered sequence of candidate passage identifiers. |
| Approach: | They propose a listwise LLM reranking approach that leverages the first generated identifier to obtain a ranked ordering of the candidates. |
| Outcome: | The proposed approach accelerates inference by 50% while maintaining robust ranking performance with gains across BEIR benchmark. |
Make Large Language Model a Better Ranker (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) demonstrate robust capabilities across various fields . current list-wise approaches fail in ranking tasks due to misalignment between ranking objectives and next-token prediction . |
| Approach: | They propose a large language model framework with Aligned Listwise Ranking Objectives (ALRO) this framework provides explicit feedback in a listwise manner by introducing soft lambda loss . |
| Outcome: | The proposed model outperforms existing recommendation methods and embedding-based recommendations without additional computational burdens. |
Boosting Self-Consistency with Ranking (2026.acl-srw)
Copied to clipboard
Maria Marina, Daniil Moskovskiy, Sergey Pletenev, Mikhail Salnikov, Alexander Panchenko, Viktor Moskvoretskii
| Challenge: | Existing approaches to improve performance of large language models include self-consistency, RISC, extended reasoning, and iterative self-correction. |
| Approach: | They propose a test-time scaling technique that uses multiple features to score candidate answers in self-consistency as a ranking problem. |
| Outcome: | The proposed method achieves better accuracy-efficiency trade-off than standard self-consistency and strong baselines on three datasets. |
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching (2025.acl-short)
Copied to clipboard
Juan Wisznia, Cecilia Bolaños, Juan Tollo, Giovanni Franco Gabriel Marraffini, Agustín Andrés Gianolini, Noe Fabian Hsueh, Luciano Del Corro
| Challenge: | a new framework for analyzing sorting algorithms in pairwise ranking prompting (PRP) is developed to re-center the cost model around LLM inferences rather than traditional pairwise comparisons. |
| Approach: | They propose a framework for analyzing sorting algorithms in pairwise ranking prompting (PRP) they propose to re-center the cost model around LLM inferences rather than traditional pairwise comparisons. |
| Outcome: | The proposed framework encourages strategies such as batching and caching to mitigate inference costs. |
Contextual Relevance and Adaptive Sampling for LLM-Based Document Reranking (2026.acl-long)
Copied to clipboard
| Challenge: | identifying relevant documents for Reasoning-intensive queries remains a challenge . large language models have shown strong performance in zero-shot document reranking . |
| Approach: | They propose a reranking algorithm that estimates contextual relevance by aggregating LLMs' relevance judgments across batches. |
| Outcome: | The proposed algorithm improves nDCG@10 over retrieval and reranking baselines by 15% and 6–21% respectively. |
Characterizing Positional Bias in Large Language Models: A Multi-Model Evaluation of Prompt Order Effects (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models can be influenced by various forms of biases, says a new study . positional bias affects how LLMs interpret and weigh information, the authors say . |
| Approach: | a new study examines the impact of positional bias on large language models . positional biased models prioritize items based on their position rather than content or quality . |
| Outcome: | a new study shows that LLMs prioritize items based on their position rather than content or quality . the positional bias affects how LLM interpret and weigh information, the authors say . |
K-order Ranking Preference Optimization for Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing list-wise methods focus on optimizing list ranking consistency for LLMs to improve ranking abilities. |
| Approach: | They propose to extend the Plackett-Luce model to accommodate top-K ranking by extending the DPO’s Plact-Lucer model to dynamically determine appropriate K for different samples. |
| Outcome: | The proposed model can be extended to accommodate top-K ranking and improve training efficiency. |
Do RAG Systems Really Suffer From Positional Bias? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Retrieval Augmented Generation (RAG) improves the factual accuracy of LLMs on knowledgeintensive tasks by including in the prompt passages retrieved from an external corpus. |
| Approach: | They propose to use a retrieval algorithm to add passages from an external corpus to the LLM prompt to improve the factual accuracy of LLMs. |
| Outcome: | The proposed approach improves the factual accuracy of LLMs on knowledgeintensive tasks by including in the prompt passages retrieved from an external corpus. |