mlsanityData to 7 Oct 2026

Overview of the TREC 2022 deep learning track

arXiv 2507.10865 ↗First posted 10 Jul 2025cs.IR cs.AI cs.CLcited by 22

Not on the map. Why?

Abstract (arXiv)

This is the fourth 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 also leverage both the refreshed passage and document collections that were released last year leading to a nearly 16 times increase in the size of the passage collection and nearly four times increase in the document collection size. Unlike previous years, in 2022 we mainly focused on constructing a more complete test collection for the passage retrieval task, which has been the primary focus of the track. The document ranking task was kept as a secondary task, where document-level labels were inferred from the passage-level labels. Our analysis shows that similar to previous years, deep neural ranking models that employ large scale pretraining continued to outperform traditional retrieval methods. Due to the focusing our judging resources on passage judging, we are more confident in the quality of this year's queries and judgments, with respect to our ability to distinguish between runs and reuse the dataset in future. We also see some surprises in overall outcomes. Some top-performing runs did not do dense retrieval. Runs that did single-stage dense retrieval were not as competitive this year as they were last year.

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

Builds on

11 of 19 references.

References · 11

  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. 2015Autonomy and Reliability of Continuous Active Learning for Technology-Assisted Reviewcited by 13
  8. 2021Significant Improvements over the State of the Art? A Case Study of the MS MARCO Document Ranking Leaderboardcited by 12
  9. 2018Optimizing Query Evaluations using Reinforcement Learning for Web Searchcited by 9
  10. 2019Incorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networkscited by 4
  11. 2022On Survivorship Bias in MS MARCOcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 8; 2026: 14.

22 papers.

Sort:

By area:

  1. 2025Evaluating the Robustness of Retrieval-Augmented Generation to Adversarial Evidence in the Health Domaincited by 5
  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. 2025Rethinking On-policy Optimization for Query Augmentationcited by 3
  6. 2026RankEvolve: Automating the Discovery of Retrieval Algorithms via LLM-Driven Evolutioncited by 3
  7. 2026100x Cost & Latency Reduction: Performance Analysis of AI Query Approximation using Lightweight Proxy Modelscited by 3
  8. 2026Learning When to Attend: Conditional Memory Access for Long-Context LLMscited by 3
  9. 2025Mitigating the Threshold Priming Effect in Large Language Model-Based Relevance Judgments via Personality Infusingcited by 2
  10. 2025Understanding Matching Mechanisms in Cross-Encoderscited by 1
  11. 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLMcited by 1
  12. 2026V3DB: Audit-on-Demand Zero-Knowledge Proofs for Verifiable Vector Search over Committed Snapshotscited by 1
10 more
  1. 2026Still Fresh? Evaluating Temporal Drift in Retrieval Benchmarkscited by 1
  2. 2026AgentSearchBench: A Benchmark for AI Agent Search in the Wildcited by 1
  3. 2026Can LLM Rerankers Predict Their Own Ranking Performance?cited by 1
  4. 2025RLRF: Competitive Search Agent Design via Reinforcement Learning from Ranker Feedbackcited by 0
  5. 2026Re-Rankers as Relevance Judgescited by 0
  6. 2026BlitzRank: Principled Zero-shot Ranking Agents with Tournament Graphscited by 0
  7. 2026RAQG-QPP: Query Performance Prediction with Retrieved Query Variants and Retrieval Augmented Query Generationcited by 0
  8. 2026Why Advanced Encoders Lag on Sparse Retrieval? The Answer and an Approach to Bridging Vocabulary Gapscited by 0
  9. 2026Structure-aware Relative Policy Optimization for Rankingcited by 0
  10. 2026VerTox: Verifiable Reward-Guided Corpus Poisoning Against Neural Ranking Modelscited by 0