ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking
On the map: Retrieval-augmented generation → Generation and context integration
Abstract (arXiv)
Reranking is fundamental to information retrieval and retrieval-augmented generation, with recent Large Language Models (LLMs) significantly advancing reranking quality. Most current works rely on large-scale LLMs (>7B parameters), presenting high computational costs. Small Language Models (SLMs) offer a promising alternative because of computational efficiency. However, our preliminary quantitative analysis reveals key limitations of SLMs: their representation space is narrow, leading to reduced expressiveness, and they struggle with understanding task prompts without fine-tuning. To address these issues, we introduce a novel two-stage training approach, ProRank, for SLM-based document reranking. We propose using reinforcement learning to improve the understanding of task prompts. Additionally, we introduce fine-grained score learning to enhance representation expressiveness and further improve document reranking quality. Extensive experiments suggest that ProRank consistently outperforms both the most advanced open-source and proprietary reranking models. Notably, our 0.5B ProRank even surpasses powerful LLM reranking models on the BEIR benchmark, establishing that properly trained SLMs can achieve superior document reranking performance while maintaining computational efficiency.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 12 of its 28 references that are in the map. First posted on arXiv 4 Jun 2025.
Builds on
12 of 28 references.
References · 12
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2019Passage Re-ranking with BERTcited by 629
- 2023Large Language Models for Information Retrieval: A Surveycited by 331
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
- 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 68
- 2024CoIR: A Comprehensive Benchmark for Code Information Retrieval Modelscited by 59
- 2025Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learningcited by 58
- 2023Open-source Large Language Models are Strong Zero-shot Query Likelihood Models for Document Rankingcited by 44
- 2023BeLLM: Backward Dependency Enhanced Large Language Model for Sentence Embeddingscited by 32
- 2024Drowning in Documents: Consequences of Scaling Reranker Inferencecited by 8
Built on by
Citing papers per year: 2025: 1; 2026: 10.
11 papers.
- 2026Your LLM Agent Can Leak Your Data: Data Exfiltration via Backdoored Tool Usecited by 9
- 2025TFRank: Think-Free Reasoning Enables Practical Pointwise LLM Rankingcited by 5
- 2026DenseOn with the LateOn: Fully Open Dense and Late-Interaction Models for Multilingual, Long-Context, and Code Searchcited by 3
- 2026AgentSearchBench: A Benchmark for AI Agent Search in the Wildcited by 1
- 2026FRESCO: Benchmarking and Optimizing Re-rankers for Evolving Semantic Conflict in Retrieval-Augmented Generationcited by 0
- 2026KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Rerankingcited by 0
- 2026Tool-Adaptive LLM Rerankercited by 0
- 2026Search over the Visual World: Persistent Visual Memory, Layered Indexes, and Source-Grounded Evidencecited by 0
- 2026Equal Ranking Quality, Different Decisions: Measuring and Reducing Order Dependence in LLM Scorerscited by 0
- 2026CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generationcited by 0
- 2026Mixture-of-Experts Language Models Can Be Strong and Efficient Retrieverscited by 0
- 2026Mixture-of-Experts Language Models Can Be Strong and Efficient Retrievers11 Sep 2026
- 2026CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation4 Sep 2026
- 2026Equal Ranking Quality, Different Decisions: Measuring and Reducing Order Dependence in LLM Scorers27 Aug 2026
- 2026Search over the Visual World: Persistent Visual Memory, Layered Indexes, and Source-Grounded Evidence8 Aug 2026
- 2026DenseOn with the LateOn: Fully Open Dense and Late-Interaction Models for Multilingual, Long-Context, and Code Search29 Jul 2026
- 2026Tool-Adaptive LLM Reranker12 Jul 2026
- 2026KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking22 Jun 2026
- 2026AgentSearchBench: A Benchmark for AI Agent Search in the Wild24 Apr 2026
- 2026FRESCO: Benchmarking and Optimizing Re-rankers for Evolving Semantic Conflict in Retrieval-Augmented Generation14 Apr 2026
- 2026Your LLM Agent Can Leak Your Data: Data Exfiltration via Backdoored Tool Use7 Apr 2026
- 2025TFRank: Think-Free Reasoning Enables Practical Pointwise LLM Ranking13 Aug 2025
Similar, not cited
Close in wording, no citation either way
- 2026Optimizing RAG Rerankers with LLM Feedback via Reinforcement Learning
- 2025DynamicRAG: Leveraging Outputs of Large Language Model as Feedback for Dynamic Reranking in Retrieval-Augmented Generation
- 2025LLM Optimization Unlocks Real-Time Pairwise Reranking
- 2025Distillation and Refinement of Reasoning in Small Language Models for Document Re-ranking
- 2025The Evolution of Reranking Models in Information Retrieval: From Heuristic Methods to Large Language Models
- 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs
- 2024APEER: Automatic Prompt Engineering Enhances Large Language Model Reranking
- 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankers