pith. sign in

arxiv: 2507.08191 · v1 · pith:5ZBWWFNZnew · submitted 2025-07-10 · 💻 cs.IR · cs.AI· cs.CL

Overview of the TREC 2021 deep learning track

classification 💻 cs.IR cs.AIcs.CL
keywords collectiondeepdocumentincreasepassageretrievalsizeyear
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. RAQG-QPP: Query Performance Prediction with Retrieved Query Variants and Retrieval Augmented Query Generation

    cs.IR 2026-04 unverdicted novelty 6.0

    Retrieved query variants from logs combined with LLM-augmented generation improve unsupervised QPP accuracy by up to 30% for neural rankers on TREC DL'19 and DL'20.

  2. Trie-based Experiment Plans for Efficient IR Pipeline Experiments

    cs.IR 2026-07 unverdicted novelty 5.0

    Trie-based experiment plans reduce the duration of comparative evaluations of IR pipelines by 26% versus linear plans in a BM25-MonoT5-DuoT5 demonstration on MSMARCO v2.

  3. Search for Coverage: Learning Coverage-Aware Retrieval with Augmented Sub-Question Answerability

    cs.IR 2026-05 unverdicted novelty 4.0

    CoveR improves nugget coverage by 10% over dense baselines in long-form RAG via coverage-aware contrastive training on LLM-generated sub-question signals without losing relevance performance.