LimRank: Less is More for Reasoning-Intensive Information Reranking

Tingyu Song, Yilun Zhao, Siyue Zhang, Chen Zhao, Arman Cohan
10/27/2025
cs.CLcs.IR

No official code found. Best implementation: SighingSnow/limrank (9 stars, last commit 2025-10-28).

Abstract

Existing approaches typically rely on large-scale fine-tuning to adapt LLMs for information reranking tasks, which is computationally expensive. In this work, we demonstrate that modern LLMs can be effectively adapted using only minimal, high-quality supervision. To enable this, we design LIMRANK-SYNTHESIZER, a reusable and open-source pipeline for generating diverse, challenging, and realistic reranking examples. Using this synthetic data, we fine-tune our reranker model, LIMRANK. We evaluate LIMRANK on two challenging benchmarks, i.e., BRIGHT for reasoning-intensive retrieval and FollowIR for instruction-following retrieval. Our experiments demonstrate that LIMRANK achieves competitive performance, while being trained on less than 5% of the data typically used in prior work. Further ablation studies demonstrate the effectiveness of LIMRANK-SYNTHESIZER and the strong generalization capabilities of LIMRANK across downstream tasks, including scientific literature search and retrieval-augmented generation for knowledge-intensive problem solving.

View on arXivView PDF

Code Implementations(1)

Official repository for EMNLP 2025 Paper "LimRank: Less is More for Reasoning-Intensive Information Reranking"

90Shell, PythonOct 8, 202511 months ago

Similar Papers

Cite this paper

@article{song2025limrank,
  title  = {LimRank: Less is More for Reasoning-Intensive Information Reranking},
  author = {Tingyu Song and Yilun Zhao and Siyue Zhang and Chen Zhao and Arman Cohan},
  year   = {2025},
  eprint = {2510.23544},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.23544v1}
}

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/2510.23544.svg)](https://codeofpaper.com/paper/2510.23544)

Discussion