An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking
Not on the map. Why?
Abstract (arXiv)
Recent advances have demonstrated that large language models (LLMs) excel as listwise rerankers, but their high computational demands remain a barrier to widespread adoption. Further, the traditional language modeling (LM) objective is not ideally suited for reranking tasks. FIRST is a novel approach that addresses these challenges by integrating a learning-to-rank objective and leveraging the logits of only the first generated token, thereby significantly reducing inference latency compared to traditional LLM rerankers. In this study, we extend the evaluation of FIRST to the TREC Deep Learning datasets (DL19-22), validating its robustness across diverse domains. We investigate the influence of different first-stage retrievers on FIRST rerankers, observing diminishing returns and patterns consistent with traditional LLM rerankers. Through applying the FIRST objective to a broader range of backbone models, we achieve effectiveness surpassing the original implementation. Our experiments confirm that fast reranking with single-token logits does not compromise out-of-domain reranking quality. To better quantify the computational savings in the original study, we measure and compare latency to find a 21%-42% gain across various models and benchmarks. Moreover, while LM training implicitly improves zero-shot single-token reranking, our experiments also raise questions about whether LM pre-training may hinder subsequent fine-tuning with the FIRST objective. These findings pave the way for more efficient and effective listwise reranking in future applications.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 16 of its 25 references that are in the map. First posted on arXiv 8 Nov 2024.
Builds on
16 of 25 references.
References · 16
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2023Zephyr: Direct Distillation of LM Alignmentcited by 498
- 2023Large Language Models for Information Retrieval: A Surveycited by 331
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
- 2020Overview of the TREC 2019 deep learning trackcited by 282
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
- 2019Multi-Stage Document Ranking with BERTcited by 200
- 2021Overview of the TREC 2020 deep learning trackcited by 193
- 2023NEFTune: Noisy Embeddings Improve Instruction Finetuningcited by 99
- 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
- 2023Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labelscited by 86
4 more
- 2024FIRST: Faster Improved Listwise Reranking with Single Token Decodingcited by 54
- 2023Unsupervised Dense Retrieval with Relevance-Aware Contrastive Pre-Trainingcited by 35
- 2024Ragnar"ok: A Reusable RAG Framework and Baselines for TREC 2024 Retrieval-Augmented Generation Trackcited by 31
- 2023Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Modelscited by 26
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Shifting from Ranking to Set Selection for Retrieval Augmented Generationcited by 13
- 2025RankArena: A Unified Platform for Evaluating Retrieval, Reranking and RAG with Human and LLM Feedbackcited by 5
- 2026Very Efficient Listwise Multimodal Reranking for Long Documentscited by 1
- 2025Embedding-Based Context-Aware Rerankercited by 0
- 2026Very Efficient Listwise Multimodal Reranking for Long Documents12 May 2026
- 2025Embedding-Based Context-Aware Reranker15 Oct 2025
- 2025RankArena: A Unified Platform for Evaluating Retrieval, Reranking and RAG with Human and LLM Feedback7 Aug 2025
- 2025Shifting from Ranking to Set Selection for Retrieval Augmented Generation9 Jul 2025