Rank1: Test-Time Compute for Reranking in Information Retrieval

Orion Weller, Kathryn Ricci, Eugene Yang, Andrew Yates, Dawn Lawrie +1 more
2/25/2025
cs.IRcs.CLcs.LG

No official code found. Best implementation: orionw/rank1 (59 stars, MIT, last commit 2025-07-08).

Abstract

We introduce Rank1, the first reranking model trained to take advantage of test-time compute. Rank1 demonstrates the applicability within retrieval of using a reasoning language model (i.e. OpenAI's o1, Deepseek's R1, etc.) for distillation in order to rapidly improve the performance of a smaller model. We gather and open-source a dataset of more than 600,000 examples of R1 reasoning traces from queries and passages in MS MARCO. Models trained on this dataset show: (1) state-of-the-art performance on advanced reasoning and instruction following datasets; (2) work remarkably well out of distribution due to the ability to respond to user-input prompts; and (3) have explainable reasoning chains that can be given to users or RAG-based systems. Further, we demonstrate that quantized versions of these models retain strong performance while using less compute/memory. Overall, Rank1 shows that test-time compute allows for a fundamentally new type of explainable and performant reranker model for search.

View on arXivView PDF

Code Implementations(1)

orionw/rank1Community100%
MIT

Test-time compute in information retrieval

597Shell, PythonFeb 20, 20251 years agoMIT

Cite this paper

@article{weller2025rank,
  title  = {Rank1: Test-Time Compute for Reranking in Information Retrieval},
  author = {Orion Weller and Kathryn Ricci and Eugene Yang and Andrew Yates and Dawn Lawrie and Benjamin Van Durme},
  year   = {2025},
  eprint = {2502.18418},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.18418v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.18418.svg)](https://codeofpaper.com/paper/2502.18418)

Discussion