mlsanityData to 7 Oct 2026

ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking

arXiv 2506.03487 ↗First posted 4 Jun 2025cs.IR cs.CLcited by 11

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

  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  3. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  4. 2019Passage Re-ranking with BERTcited by 629
  5. 2023Large Language Models for Information Retrieval: A Surveycited by 331
  6. 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
  7. 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 68
  8. 2024CoIR: A Comprehensive Benchmark for Code Information Retrieval Modelscited by 59
  9. 2025Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learningcited by 58
  10. 2023Open-source Large Language Models are Strong Zero-shot Query Likelihood Models for Document Rankingcited by 44
  11. 2023BeLLM: Backward Dependency Enhanced Large Language Model for Sentence Embeddingscited by 32
  12. 2024Drowning in Documents: Consequences of Scaling Reranker Inferencecited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 10.

11 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Optimizing RAG Rerankers with LLM Feedback via Reinforcement Learning
  2. 2025DynamicRAG: Leveraging Outputs of Large Language Model as Feedback for Dynamic Reranking in Retrieval-Augmented Generation
  3. 2025LLM Optimization Unlocks Real-Time Pairwise Reranking
  4. 2025Distillation and Refinement of Reasoning in Small Language Models for Document Re-ranking
  5. 2025The Evolution of Reranking Models in Information Retrieval: From Heuristic Methods to Large Language Models
  6. 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs
  7. 2024APEER: Automatic Prompt Engineering Enhances Large Language Model Reranking
  8. 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankers