mlsanityData to 7 Oct 2026

Overview of the TREC 2021 deep learning track

arXiv 2507.08191 ↗First posted 10 Jul 2025cs.IR cs.AI cs.CLcited by 18

Not on the map. Why?

Abstract (arXiv)

This is the third year of the TREC Deep Learning track. As in previous years, we leverage the MS MARCO datasets that made hundreds of thousands of human annotated training labels available for both passage and document ranking tasks. In addition, this year we refreshed both the document and the passage collections which also led to a nearly four times increase in the document collection size and nearly 16 times increase in the size of the passage collection. Deep neural ranking models that employ large scale pretraininig continued to outperform traditional retrieval methods this year. We also found that single stage retrieval can achieve good performance on both tasks although they still do not perform at par with multistage retrieval pipelines. Finally, the increase in the collection size and the general data refresh raised some questions about completeness of NIST judgments and the quality of the training labels that were mapped to the new collections from the old ones which we discuss in this report.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 9 of its 19 references that are in the map. First posted on arXiv 10 Jul 2025.

Builds on

9 of 19 references.

References · 9

  1. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  2. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
  3. 2020Overview of the TREC 2019 deep learning trackcited by 282
  4. 2021Overview of the TREC 2020 deep learning trackcited by 193
  5. 2021MS MARCO: Benchmarking Ranking Models in the Large-Data Regimecited by 28
  6. 2021TREC Deep Learning Track: Reusable Test Collections in the Large Data Regimecited by 23
  7. 2021Significant Improvements over the State of the Art? A Case Study of the MS MARCO Document Ranking Leaderboardcited by 12
  8. 2018Optimizing Query Evaluations using Reinforcement Learning for Web Searchcited by 9
  9. 2019Incorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networkscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 7; 2026: 11.

18 papers.

Sort:

By area:

  1. 2025RAVine: Reality-Aligned Evaluation for Agentic Searchcited by 6
  2. 2025An Efficient Rubric-based Generative Verifier for Search-Augmented LLMscited by 4
  3. 2026Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibrationcited by 4
  4. 2025Test-time Corpus Feedback: From Retrieval to RAGcited by 3
  5. 2025Mitigating the Threshold Priming Effect in Large Language Model-Based Relevance Judgments via Personality Infusingcited by 2
  6. 2026Scaling Laws for Embedding Dimension in Information Retrievalcited by 2
  7. 2025Understanding Matching Mechanisms in Cross-Encoderscited by 1
  8. 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLMcited by 1
  9. 2026Judging with Personality and Confidence: A Study on Personality-Conditioned LLM Relevance Assessmentcited by 1
  10. 2026Still Fresh? Evaluating Temporal Drift in Retrieval Benchmarkscited by 1
  11. 2025Blending Learning to Rank and Dense Representations for Efficient and Effective Cascadescited by 0
  12. 2026MACA: A Framework for Distilling Trustworthy LLMs into Efficient Retrieverscited by 0
6 more
  1. 2026Re-Rankers as Relevance Judgescited by 0
  2. 2026BlitzRank: Principled Zero-shot Ranking Agents with Tournament Graphscited by 0
  3. 2026RAQG-QPP: Query Performance Prediction with Retrieved Query Variants and Retrieval Augmented Query Generationcited by 0
  4. 2026Search for Coverage: Learning Coverage-Aware Retrieval with Augmented Sub-Question Answerabilitycited by 0
  5. 2026Q2D-Web: A Large-Scale Benchmark for Retrieval in Agentic RAG Systemscited by 0
  6. 2026No More Free Lunch: Corpus Task Complexity Matters as Corpora Growcited by 0