How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a systematic and comprehensive empirical evaluation of state-of-the-art reranking methods is presented. |
| Approach: | They evaluate 22 reranking methods including 40 variants across established benchmarks . primary goal is to determine whether performance disparity exists between LLM-based reranters and lightweight counterparts based on novel queries . |
| Outcome: | The proposed methods perform better on familiar queries than lightweight models, the authors show . |
Similar Papers
Efficiency-Effectiveness Reranking FLOPs for LLM-based Rerankers (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Existing studies evaluate the efficiency of LLM-based rerankers using proxy metrics such as latency and the number of forward passes. |
| Approach: | They propose to use a large language model to evaluate the efficiency of LLM-based rerankers . they propose to measure ranking quality and query processing efficiency using an interpretable FLOPs estimator . |
| Outcome: | The proposed metrics evaluate LLM-based rerankers with different architectures without running any experiments. |
Do Large Language Models Rank Fairly? An Empirical Study on the Fairness of LLMs as Rankers (2024.naacl-long)
Copied to clipboard
| Challenge: | Recent studies have shown that Large Language Models (LLMs) are more efficient in natural language understanding tasks. |
| Approach: | They evaluate large language models (LLMs) using a TREC Fair Ranking dataset . they assess fairness from both user and content perspectives . |
| Outcome: | The proposed model outperforms the existing models in the fair ranking task. |
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. |
Zero-Shot Cross-Lingual Reranking with Large Language Models for Low-Resource Languages (2024.acl-short)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown impressive zero-shot capabilities in various passage ranking tasks. |
| Approach: | They analyze and compare the effectiveness of monolingual reranking using query or document translations and evaluate the effectiveness when leveraging their own generated translations. |
| Outcome: | The proposed models perform better when using their own translations than when using query or document translations. |
Large Language Model Is Not a Good Few-shot Information Extractor, but a Good Reranker for Hard Samples! (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models have made remarkable strides in various tasks, but whether they are competitive few-shot solvers remains an open question. |
| Approach: | They propose an adaptive filter-then-rerank paradigm to combine the strengths of LLMs and SLMs. |
| Outcome: | The proposed system achieves promising improvements on various IE tasks with acceptable time and cost investment. |
Ranking Unraveled: Recipes for LLM Rankings in Head-to-Head AI Combat (2025.acl-long)
Copied to clipboard
| Challenge: | Evaluating large language models (LLMs) is a complex task. Pairwise ranking has emerged as state-of-the-art method to evaluate human preferences. |
| Approach: | They propose to use pairwise ranking to evaluate human preferences . they propose to evaluate the robustness of ranking algorithms in LLMs . |
| Outcome: | The proposed methods are based on the principles of effective ranking and the robustness of several ranking algorithms in the context of LLMs. |
BracketRank: Large Language Model Document Ranking via Reasoning-based Competitive Elimination (2026.acl-long)
Copied to clipboard
| Challenge: | Existing lists of document ranking methods lack robust performance across domains. |
| Approach: | They propose a reasoning-driven competitive elimination framework that optimises group sizes based on LLM context limits and reasoning-enhanced prompts. |
| Outcome: | The proposed method outperforms RankGPT and other state-of-the-art methods on datasets with a 77.90 NDCG@5 score and 54.66 average NDGC@10 on BEIR datasets. |
Open-source Large Language Models are Strong Zero-shot Query Likelihood Models for Document Ranking (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies show that large language models (LLMs) rank documents based on the probability of generating the query given the content of a document. |
| Approach: | They propose a ranking system that integrates LLMs with a hybrid zero-shot retriever. |
| Outcome: | The proposed system shows exceptional ranking in both zero-shot and few-shot scenarios. |
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. |
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers (2023.emnlp-main)
Copied to clipboard
Jon Saad-Falcon, Omar Khattab, Keshav Santhanam, Radu Florian, Martin Franz, Salim Roukos, Avirup Sil, Md Sultan, Christopher Potts
| Challenge: | Existing methods for information retrieval tasks require large labeled datasets for fine-tuning, but they can experience significant drops in accuracy due to distribution shifts from the training to the target domain. |
| Approach: | They propose a method for using large language models to generate large numbers of synthetic queries cheaply using an expensive LLM. |
| Outcome: | The proposed method boosts zero-shot accuracy in long-tail domains and achieves substantially lower latency than standard reranking methods. |