mlsanityData to 14 Oct 2026

Benchmarking Information Retrieval Models on Complex Retrieval Tasks

arXiv 2509.07253 ↗First posted 8 Sep 2025cs.IR cs.AI cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) are incredible and versatile tools for text-based tasks that have enabled countless, previously unimaginable, applications. Retrieval models, in contrast, have not yet seen such capable general-purpose models emerge. To achieve this goal, retrieval models must be able to perform complex retrieval tasks, where queries contain multiple parts, constraints, or requirements in natural language. These tasks represent a natural progression from the simple, single-aspect queries that are used in the vast majority of existing, commonly used evaluation sets. Complex queries naturally arise as people expect search systems to handle more specific and often ambitious information requests, as is demonstrated by how people use LLM-based information systems. Despite the growing desire for retrieval models to expand their capabilities in complex retrieval tasks, there exist limited resources to assess the ability of retrieval models on a comprehensive set of diverse complex tasks. The few resources that do exist feature a limited scope and often lack realistic settings making it hard to know the true capabilities of retrieval models on complex real-world retrieval tasks. To address this shortcoming and spur innovation in next-generation retrieval models, we construct a diverse and realistic set of complex retrieval tasks and benchmark a representative set of state-of-the-art retrieval models. Additionally, we explore the impact of LLM-based query expansion and rewriting on retrieval quality. Our results show that even the best models struggle to produce high-quality retrieval results with the highest average nDCG@10 of only 0.346 and R@100 of only 0.587 across all tasks. Although LLM augmentation can help weaker models, the strongest model has decreased performance across all metrics with all rewriting techniques.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 44 of its 75 references that are in the map. First posted on arXiv 8 Sep 2025.

Builds on

44 of 75 references.

References · 44

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  6. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  7. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  8. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  9. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  10. 2022Atlas: Few-shot Learning with Retrieval Augmented Language Modelscited by 952
  11. 2021Measuring Coding Challenge Competence With APPScited by 902
  12. 2018The Web as a Knowledge-base for Answering Complex Questionscited by 410
32 more
  1. 2022One Embedder, Any Task: Instruction-Finetuned Text Embeddingscited by 333
  2. 2020Overview of the TREC 2019 deep learning trackcited by 286
  3. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  4. 2020HybridQA: A Dataset of Multi-Hop Question Answering over Tabular and Textual Datacited by 264
  5. 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 235
  6. 2021Overview of the TREC 2020 deep learning trackcited by 196
  7. 2017Constructing Datasets for Multi-hop Reading Comprehension Across Documentscited by 190
  8. 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 113
  9. 2025ReasonIR: Training Retrievers for Reasoning Taskscited by 77
  10. 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 70
  11. 2024FollowIR: Evaluating and Teaching Information Retrieval Models to Follow Instructionscited by 69
  12. 2024CoIR: A Comprehensive Benchmark for Code Information Retrieval Modelscited by 60
  13. 2024Arctic-Embed 2.0: Multilingual Retrieval Without Compromisecited by 58
  14. 2024Promptriever: Instruction-Trained Retrievers Can Be Prompted Like Language Modelscited by 40
  15. 2025A Reasoning-Focused Legal Retrieval Benchmarkcited by 37
  16. 2023QUEST: A Retrieval Dataset of Entity-Seeking Queries with Implicit Set Operationscited by 31
  17. 2023NevIR: Negation in Neural Information Retrievalcited by 29
  18. 2023Decomposing Complex Queries for Tip-of-the-tongue Retrievalcited by 24
  19. 2024MAIR: A Massive Benchmark for Evaluating Instructed Retrievalcited by 23
  20. 2025R2MED: A Benchmark for Reasoning-Driven Medical Retrievalcited by 22
  21. 2021Searching for Scientific Evidence in a Pandemic: An Overview of TREC-COVIDcited by 19
  22. 2022RoMQA: A Benchmark for Robust, Multi-evidence, Multi-answer Question Answeringcited by 19
  23. 2024PL-MTEB: Polish Massive Text Embedding Benchmarkcited by 19
  24. 2022RELIC: Retrieving Evidence for Literary Claimscited by 18
  25. 2024BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectivescited by 15
  26. 2021Tip of the Tongue Known-Item Retrieval: A Case Study in Movie Identificationcited by 14
  27. 2025Scaling Sparse and Dense Retrieval in Decoder-Only LLMscited by 12
  28. 2024Comparing Traditional and LLM-based Search for Image Geolocationcited by 10
  29. 2025Hypencoder: Hypernetworks for Information Retrievalcited by 7
  30. 2025Reproducing NevIR: Negation in Neural Information Retrievalcited by 7
  31. 2025ATEB: Evaluating and Improving Advanced NLP Tasks for Text Embedding Modelscited by 5
  32. 2025VN-MTEB: Vietnamese Massive Text Embedding Benchmarkcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 6.

6 papers.