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. |
Similar Papers
REALM: Recursive Relevance Modeling for LLM-based Document Re-Ranking (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing LLMs face ranking uncertainty, unstable top-k recovery, and high token cost due to token-intensive prompting. |
| Approach: | They propose a re-ranking framework that captures uncertainty and refines LLM-derived relevance through recursive Bayesian updates. |
| Outcome: | The proposed framework outperforms state-of-the-art re-rankers while reducing token usage and latency. |
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. |
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 . |
Self-Supervised Document Similarity Ranking via Contextualized Language Models and Hierarchical Inference (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to document-to-document similarity ranking are limited to relatively short documents or lack similarity labels. |
| Approach: | They propose a self-supervised method for document similarity ranking that can be applied to documents of arbitrary length. |
| Outcome: | The proposed model outperforms existing methods on large documents datasets. |
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. |
LimRank: Less is More for Reasoning-Intensive Information Reranking (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to rerank information require large-scale fine-tuning, which is computationally expensive. |
| Approach: | They propose an open-source pipeline for generating diverse, challenging, and realistic reranking examples. |
| Outcome: | The proposed model performs competitively on two benchmarks, while being trained on less than 5% of the data typically used in prior work. |
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. |
BERT-QE: Contextualized Query Expansion for Document Re-ranking (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to expand query use pseudo relevance feedback (PRF) but they are under-equipped to evaluate the relevance of information pieces used for expansion. |
| Approach: | They propose a query expansion model that leverages the BERT model to select relevant document chunks for expansion. |
| Outcome: | The proposed model significantly outperforms existing models on the TREC Robust04 and GOV2 test collections. |
Deep Relevance Ranking Using Enhanced Document-Query Interactions (D18-1)
Copied to clipboard
| Challenge: | Document relevance ranking is the task of ranking documents from a large collection using the query and the text of each document only. |
| Approach: | They propose to use convolutional n-gram matching to inject rich context-sensitive encodings into their models, inspired by PACRR's convolution-based ngram matching features. |
| Outcome: | The proposed models outperform baselines, DRMM, and PACRR on the BIOASQ and TREC ROBUST questions and document inputs. |
Optimizing RAG Rerankers with LLM Feedback via Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Current reranking models are optimized on static human annotations in isolation, decoupled from the downstream generation process. |
| Approach: | They propose a reinforcement learning framework that directly aligns reranking with LLM's generation quality. |
| Outcome: | Experiments on knowledge-intensive benchmarks show that RRPO outperforms strong baselines. |