mlsanityData to 14 Oct 2026

Don't "Overthink" Passage Reranking: Is Reasoning Truly Necessary?

arXiv 2505.16886 ↗First posted 22 May 2025cs.IR cs.AI cs.CLcited by 7

On the map: LLM reasoning → Knowledge- and tool-augmented reasoning

Abstract (arXiv)

With the growing success of reasoning models across complex natural language tasks, researchers in the Information Retrieval (IR) community have begun exploring how similar reasoning capabilities can be integrated into passage rerankers built on Large Language Models (LLMs). These methods typically employ an LLM to produce an explicit, step-by-step reasoning process before arriving at a final relevance prediction. But, does reasoning actually improve reranking accuracy? In this paper, we dive deeper into this question, studying the impact of the reasoning process by comparing reasoning-based pointwise rerankers (ReasonRR) to standard, non-reasoning pointwise rerankers (StandardRR) under identical training conditions, and observe that StandardRR generally outperforms ReasonRR. Building on this observation, we then study the importance of reasoning to ReasonRR by disabling its reasoning process (ReasonRR-NoReason), and find that ReasonRR-NoReason is surprisingly more effective than ReasonRR. Examining the cause of this result, our findings reveal that reasoning-based rerankers are limited by the LLM's reasoning process, which pushes it toward polarized relevance scores and thus fails to consider the partial relevance of passages, a key factor for the accuracy of pointwise rerankers.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in Knowledge- and tool-augmented reasoning, one of 17 directions in LLM reasoning. Builds on 15 of its 31 references that are in the map. First posted on arXiv 22 May 2025.

Builds on

15 of 31 references.

Closest ancestors · 5

Same direction, newest first

  1. 2025ReasonIR: Training Retrievers for Reasoning Tasks29 Apr
  2. 2025Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning8 Mar
  3. 2025Rank1: Test-Time Compute for Reranking in Information Retrieval25 Feb
  4. 2025Learning Refined Document Representations for Dense Retrieval via Deliberate Thinking18 Feb
  5. 2025O1 Embedder: Let Retrievers Think Before Action11 Feb

Other references · 10

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  3. 2024Qwen2.5 Technical Reportcited by 4,942
  4. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  5. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  6. 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Modelscited by 464
  7. 2025TokenSkip: Controllable Chain-of-Thought Compression in LLMscited by 249
  8. 2025Reasoning Models Can Be Effective Without Thinkingcited by 187
  9. 2024Distilling System 2 into System 1cited by 159
  10. 2025Self-Training Elicits Concise Reasoning in Large Language Modelscited by 99

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024ReasoningRank: Teaching Student Models to Rank through Reasoning-Based Knowledge Distillation
  2. 2026Think Thrice Before Reranking: Multi-perspective Evidence and Reasoning Integration for Text Reranking
  3. 2025ReasonRank: Empowering Passage Ranking with Strong Reasoning Ability
  4. 2026Stop Overthinking: Unlocking Efficient Listwise Reranking with Minimal Reasoning
  5. 2025InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking
  6. 2026QReason: Query-Focused Decoupled Chain-of-Thought for Efficient Passage Reranking
  7. 2025Rank-K: Test-Time Reasoning for Listwise Reranking
  8. 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs