REVIEW 20 cited by
Zero-Shot Listwise Document Reranking with a Large Language Model
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Supervised ranking methods based on bi-encoder or cross-encoder architectures have shown success in multi-stage text ranking tasks, but they require large amounts of relevance judgments as training data. In this work, we propose Listwise Reranker with a Large Language Model (LRL), which achieves strong reranking effectiveness without using any task-specific training data. Different from the existing pointwise ranking methods, where documents are scored independently and ranked according to the scores, LRL directly generates a reordered list of document identifiers given the candidate documents. Experiments on three TREC web search datasets demonstrate that LRL not only outperforms zero-shot pointwise methods when reranking first-stage retrieval results, but can also act as a final-stage reranker to improve the top-ranked results of a pointwise method for improved efficiency. Additionally, we apply our approach to subsets of MIRACL, a recent multilingual retrieval dataset, with results showing its potential to generalize across different languages.
Forward citations
Cited by 20 Pith papers
-
How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models
On a new benchmark of post-April 2025 queries, LLM rerankers show a 5-15% performance drop compared with familiar benchmarks, and lightweight models match them on efficiency and sometimes accuracy.
-
Likert or Not: LLM Absolute Relevance Judgments on Fine-Grained Ordinal Scales
Pointwise LLM scoring with an 11-point ordinal scale is statistically competitive with listwise ranking for 31 of 40 model-dataset combinations on NDCG@10.
-
ShopX: A Foundation Model for Intent-to-Item Fulfillment in Agentic Shopping
ShopX is a single foundation model combining intent understanding, planning, and SID-native item fulfillment for agentic shopping, with claimed improvements over tool-mediated systems on Taobao logs.
-
Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization
RAF, a two-stage token-optimization attack, creates brief natural-sounding text injections that reliably boost a target item's rank in LLM reranking outputs, beating state-of-the-art baselines in effectiveness, stealt...
-
Verbalized Algorithms: Classical Algorithms are All You Need (Mostly)
Wrapping LLM calls as oracles in classical algorithms improves sorting and clustering accuracy for small models, but several advertised applications are missing from the experiments.
-
ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking
ERank trains a pointwise reasoning-LLM reranker with fine-grained integer scoring and a listwise reinforcement-learning reward, reporting nDCG@10 of 40.2 on BRIGHT for its 32B variant with BM25 hybrid scoring.
-
From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation
DPS is a supervised dynamic passage selector that improves RAG answer accuracy over fixed-K rerankers on five benchmarks.
-
JointRank: Rank Large Set with Single Pass
JointRank partitions candidates into overlapping blocks, ranks each block in parallel with an LLM, and reconstructs a global ranking by aggregating the resulting pairwise comparisons.
-
SGIC: A Self-Guided Iterative Calibration Framework for RAG
SGIC feeds a model's own uncertainty scores back into its prompt for several calibration rounds and improves RAG accuracy on HotpotQA, NQ, and GSM8K.
-
MM-R5: MultiModal Reasoning-Enhanced ReRanker via Reinforcement Learning for Document Retrieval
MM-R5, a 7B multimodal re-ranker trained with SFT and GRPO, achieves state-of-the-art page-level recall on MMDocIR by generating per-page reasoning chains.
-
Precise Zero-Shot Pointwise Ranking with LLMs through Post-Aggregated Global Context Information
A summary-based anchor document enables contrastive pointwise scoring that, when averaged with ordinary pointwise scores, improves zero-shot LLM reranking.
-
SQLens: An End-to-End Framework for Error Detection and Correction in Text-to-SQL
SQLens uses weak supervision over database and LLM error signals to detect clause-level semantic errors in text-to-SQL and fixes them iteratively, improving execution accuracy on BIRD and Spider.
-
Rank-K: Test-Time Reasoning for Listwise Reranking
Rank-K, a reasoning-model-based listwise reranker distilled from DeepSeek R1 traces, beats RankZephyr on several benchmarks but only marginally on TREC DL 2019/2020.
-
CORE: A Unified Cascaded Ordinal Relevance Estimation Framework for E-commerce Search
Cascaded binary relevance decisions with step-level GRPO and PostCoT distillation improve offline accuracy and cut online bad-case rate by 15.94% versus flat multi-class baselines.
-
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
Under an LLM-inference cost model, Quicksort with batching uses roughly 44% fewer inference calls than Heapsort for pairwise document ranking, reversing the classical comparison-count ordering.
-
REARANK: Reasoning Re-ranking Agent via Reinforcement Learning
Training a listwise reranker with reinforcement learning and explicit reasoning on only 179 annotated queries yields reranking quality comparable to GPT-4.
-
RankLLM: A Python Package for Reranking with LLMs
RankLLM is an open-source Python package that modularly supports pointwise, pairwise, and listwise LLM rerankers, with integrated retrieval, evaluation, training, and response analysis, and reproduces results from Ran...
-
Hierarchical Reranking for Scalable Financial RAG System
A finance-specific RAG pipeline combining table-to-JSON conversion, two-stage reranking, and long-context split-fusion reports NDCG@20=0.7918 and second place in the ICAIF '24 FinanceRAG challenge.
-
MagicSelector: Joint Optimization for Agent Tool Selection via Counterfactual Decomposition and Progressive Reranking
MagicSelector combines RL-trained task decomposition, iterative hard-negative reranking, and adaptive top-k truncation to improve mobile-agent tool retrieval, evaluated on a new MTDTool benchmark.
-
Beyond Retrieval: Ensembling Cross-Encoders and GPT Rerankers with LLMs for Biomedical QA
An ensemble of finetuned cross-encoders and GPT-4o rerankers over dense-vector retrieval achieved rank 10 in BioASQ 2025 Phase A retrieval and rank 1 on factoid answers.
Discussion (0). Sign in to comment.