In pointwise document reranking, Chain-of-Thought models consistently underperform direct scoring models, a gap that persists across models up to 32B parameters. The authors conducted stress tests—reinforcement learning, fine‑grained supervision, and architectural decoupling—to address classification, score polarization, and calibration issues, which improved absolute scores but did not close the relative ranking gap. Their results indicate that routing continuous relevance semantics through discrete text imposes a stable bottleneck in ranking resolution that current standard methods cannot easily overcome.
arXiv:2602. 12424v2 Announce Type: replace-cross Abstract: Benchmarks establish a standardized evaluation framework to systematically assess the performance of large language models (LLMs), facilitating objective comparisons and driving advancements in the field.
arXiv:2607. 10555v1 Announce Type: cross Abstract: Generative Large Language Models (LLMs) have revolutionized information retrieval, yet their strictly parametric nature frequently leads to severe factual hallucinations when confronted with complex queries beyond their epistemic boundaries.
arXiv:2608. 10528v1 Announce Type: cross Abstract: Anchor-based pointwise LLM reranking scores each candidate against a shared reference passage to recover cross-document context at pointwise cost.
Re$^3$Rank is a listwise reranker that uses reasoning-conditioned retrieval heads (RRHeads). It generates a reasoning trace for each candidate, then scores candidates by using the trace tokens as attention queries for selected RRHeads, producing continuous relevance scores. A straight‑through estimator allows joint training of the generator and scorer, and on nine benchmarks the 4B model outperforms 11 baseline rerankers by an average of 3.11 NDCG@10 points, while the 0.6B model beats rerankers with up to 32B parameters.
arXiv:2610.22797v1 Announce Type: cross Abstract: Reasoning rerankers write a rationale before ranking a candidate slate, and existing systems read item metadata to do so, even though generative reco...
arXiv:2606. 01070v1 Announce Type: cross Abstract: Dense retrievers excel at first-stage candidate generation but lack effective reranking in zero-resource settings.
Anchor-based pointwise LLM reranking scores each candidate against a shared reference passage to recover cross-document context at pointwise cost. We study when this actually helps, using GCCP/PAGC as a representative method.
MERIT‑Rank is a reranking framework that integrates multiple reasoning trajectories to enhance text ranking robustness. It introduces a Multi‑Trajectory Reasoning Space (MTRS) to evaluate query‑document relevance from diverse perspectives and a joint reranker that consolidates these paths into a single ranking decision. The Progressive Rank Policy Optimization (PRPO) training scheme stabilizes reasoning trajectories and progressively improves ranking quality, yielding superior performance on both reasoning‑intensive and traditional retrieval benchmarks, with a 4B model outperforming larger 7B and 32B rerankers on BRIGHT.
arXiv:2605. 04495v2 Announce Type: replace-cross Abstract: Retrieval-augmented generation (RAG) relies on evidence ranking to determine what information is exposed to the generator, yet existing retrieval and reranking methods primarily estimate query--document relevance.
arXiv:2608.23338v1 Announce Type: cross Abstract: LoRA fine-tuning is standard for adapting LLMs to reranking, but it remains unclear where in the network task-specific relevance behavior is learned...
arXiv:2604. 02091v2 Announce Type: replace-cross Abstract: Rerankers play a pivotal role in refining retrieval results for Retrieval-Augmented Generation.
DecisionRank introduces an on-policy distillation (OPD) method that trains decision models to replicate a generative LLM’s ranking knowledge by converting the student’s document scores into a ranked sequence and using a teacher to provide conditional feedback. The approach combines item‑space OPD with offline ranking supervision, achieving state‑of‑the‑art results on retrieval benchmarks such as TREC DL, BEIR, and BRIGHT. Even with a 1.7B parameter model, DecisionRank outperforms its 27B generative teacher on TREC DL19–23, and at 8B it surpasses the generative listwise counterpart while running 24.5× faster on TREC DL and 16.7× faster on BRIGHT.