Don't "Overthink" Passage Reranking: Is Reasoning Truly Necessary?
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.
Introduction. Recently, there has been a surge of interest in reasoning models such as DeepSeek-R1 (Guo et al., 2025), OpenAI’s o3, Qwen3 (Yang et al., 2025), and others. By generating an explicit reasoning process — i.e., a chain-of-thought (CoT) — prior to producing its final response, reasoning models have shown strong performance across a wide range of complex natural language tasks such as mathematics (Yang et al., 2024). Following the success of reasoning models, researchers in the Information Retrieval (IR) com-
Discussion / Conclusion. In this work, we study whether scaling test-time compute—via generation of reasoning tokens prior to making a relevance prediction—actually improves the accuracy of pointwise rerankers. To do so, we train and evaluate three pointwise rerankers, StandardRR, ReasonRR, and ReasonRR- NoReason. Through experiments across in-domain and out-of-domain datasets, we find that the reasoning process consistently harms the accuracy of pointwise rerankers, especially as LLM size increases. Investigating the root cause of this result, we observe that the reasoning process restricts ReasonRR’s ability to capture partial relevance between query-document pairs, which is an important factor for pointwise reranking accuracy. While we explored self-consistency as a potential remedy for this restriction, StandardRR still outperformed ReasonRR + Self-Consistency.
Lines of inquiry this paper opens 24
Research framings built by reading the notes related to this paper — the questions it feeds into.
How reliably can AI-generated text be distinguished from human writing? Can evaluation metrics recognize meaningful disagreement as signal rather than noise? What are the actual limits of what prompting techniques can accomplish? Can language models reliably apply internal reasoning to their outputs? How should recommendation systems balance individual preferences, population signals, and concept drift? Why do retrieval-augmented generation systems systematically fail in practice? How should information retrieval adapt across different multi-step reasoning needs?- What makes proactive tool retrieval better than single-round semantic matching?
- What documents improve answers beyond surface query similarity?
- Could real-time search systems avoid era sensitivity in legal reasoning?
- Why does document-document similarity work better than query-document matching?
- Can adaptive elbow detection replace fixed top-k limits in evidence retrieval?
- Why does adaptive document allocation improve over fixed k selection?
- Does RL pruning of documents differ fundamentally from rationale-driven evidence selection?
- Can embedding-based retrieval alone solve the causal relevance problem?
- Can reranking candidate summaries improve perspective representation better than prompting?
- What makes prerequisite filtering more reliable than semantic similarity matching?
- Can models retrieve the right tool without relying on vector similarity?