mlsanityData to 14 Oct 2026

InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking

arXiv 2506.14086 ↗First posted 17 Jun 2025cs.IR cs.AI cs.CLcited by 4

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

Abstract (arXiv)

Large Language Models (LLMs) have demonstrated significant strides across various information retrieval tasks, particularly as rerankers, owing to their strong generalization and knowledge-transfer capabilities acquired from extensive pretraining. In parallel, the rise of LLM-based chat interfaces has raised user expectations, encouraging users to pose more complex queries that necessitate retrieval by ``reasoning'' over documents rather than through simple keyword matching or semantic similarity. While some recent efforts have exploited reasoning abilities of LLMs for reranking such queries, considerable potential for improvement remains. In that regards, we introduce InsertRank, an LLM-based reranker that leverages lexical signals like BM25 scores during reranking to further improve retrieval performance. InsertRank demonstrates improved retrieval effectiveness on -- BRIGHT, a reasoning benchmark spanning 12 diverse domains, and R2MED, a specialized medical reasoning retrieval benchmark spanning 8 different tasks. We conduct an exhaustive evaluation and several ablation studies and demonstrate that InsertRank consistently improves retrieval effectiveness across multiple families of LLMs, including GPT, Gemini, and Deepseek models. %In addition, we also conduct ablation studies on normalization by varying the scale of the BM25 scores, and positional bias by shuffling the order of the documents. With Deepseek-R1, InsertRank achieves a score of 37.5 on the BRIGHT benchmark. and 51.1 on the R2MED benchmark, surpassing previous methods.

Key facts. Cited by 4 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 20 of its 25 references that are in the map. First posted on arXiv 17 Jun 2025.

Builds on

20 of 25 references.

Closest ancestors · 5

Same direction, newest first

  1. 2025Rank-K: Test-Time Reasoning for Listwise Reranking20 May
  2. 2025ReasonIR: Training Retrievers for Reasoning Tasks29 Apr
  3. 2025Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning8 Mar
  4. 2025Rank1: Test-Time Compute for Reranking in Information Retrieval25 Feb
  5. 2024JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Reranking31 Oct

Other references · 15

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
  3. 2024Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMscited by 570
  4. 2024GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Modelscited by 550
  5. 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 517
  6. 2019Document Expansion by Query Predictioncited by 231
  7. 2024BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrievalcited by 158
  8. 2023RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!cited by 155
  9. 2023Generative Query Reformulation for Effective Adhoc Searchcited by 24
  10. 2023Mathematical Language Models: A Surveycited by 24
  11. 2025R2MED: A Benchmark for Reasoning-Driven Medical Retrievalcited by 22
  12. 2023Injecting the BM25 Score as Text Improves BERT-Based Re-rankerscited by 17
3 more
  1. 2024Generative Query Reformulation Using Ensemble Prompting, Document Fusion, and Relevance Feedbackcited by 5
  2. 2025Learning to Stop Overthinking at Test Timecited by 4
  3. 2024Probing LLM Hallucination from Within: Perturbation-Driven Approach via Internal Knowledgecited by 2

Built on by

Cited by year (2026 to 14 Oct)

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

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025LimRank: Less is More for Reasoning-Intensive Information Reranking
  2. 2025RankLLM: A Python Package for Reranking with LLMs
  3. 2025LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking
  4. 2025DeAR: Dual-Stage Document Reranking with Reasoning Agents via LLM Distillation
  5. 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs
  6. 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM
  7. 2025EnrichIndex: Using LLMs to Enrich Retrieval Indices Offline
  8. 2026LLM-Confidence Reranker: A Training-Free Approach for Enhancing Retrieval-Augmented Generation Systems