mlsanityData to 7 Oct 2026

How Deep is your Learning: the DL-HARD Annotated Deep Learning Dataset

arXiv 2105.07975 ↗First posted 17 May 2021cs.IRcited by 18

Not on the map. Why?

Abstract (arXiv)

Deep Learning Hard (DL-HARD) is a new annotated dataset designed to more effectively evaluate neural ranking models on complex topics. It builds on TREC Deep Learning (DL) topics by extensively annotating them with question intent categories, answer types, wikified entities, topic categories, and result type metadata from a commercial web search engine. Based on this data, we introduce a framework for identifying challenging queries. DL-HARD contains fifty topics from the official DL 2019/2020 evaluation benchmark, half of which are newly and independently assessed. We perform experiments using the official submitted runs to DL on DL-HARD and find substantial differences in metrics and the ranking of participating systems. Overall, DL-HARD is a new resource that promotes research on neural ranking methods by focusing on challenging and complex topics.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 May 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 4; 2023: 1; 2024: 2; 2025: 3; 2026: 7.

18 papers.

Sort:

By area:

  1. 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedbackcited by 45
  2. 2022CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typoscited by 22
  3. 2025AcuRank: Uncertainty-Aware Adaptive Computation for Listwise Rerankingcited by 8
  4. 2025Hypencoder: Hypernetworks for Information Retrievalcited by 7
  5. 2026A Reproducibility Study of LLM-Based Query Reformulationcited by 2
  6. 2022LoL: A Comparative Regularization Loss over Query Reformulation Losses for Pseudo-Relevance Feedbackcited by 1
  7. 2022Are We There Yet? A Decision Framework for Replacing Term Based Retrieval with Dense Retrieval Systemscited by 1
  8. 2022Query-Specific Knowledge Graphs for Complex Finance Topicscited by 1
  9. 2023Cross-Model Comparative Loss for Enhancing Neuronal Utility in Language Understandingcited by 1
  10. 2025Exploring the Effectiveness of Multi-stage Fine-tuning for Cross-encoder Re-rankerscited by 1
  11. 2026ReFormeR: Learning and Applying Explicit Query Reformulation Patternscited by 1
  12. 2026ADORE: Iterative Query Expansion with Retrieval-Grounded Relevance Feedbackcited by 1
6 more
  1. 2024The Surprising Effectiveness of Rankers Trained on Expanded Queriescited by 0
  2. 2024Understanding the User: An Intent-Based Ranking Datasetcited by 0
  3. 2026BlitzRank: Principled Zero-shot Ranking Agents with Tournament Graphscited by 0
  4. 2026Hypencoder Revisited: Reproducibility and Analysis of Non-Linear Scoring for First-Stage Retrievalcited by 0
  5. 2026PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAIDcited by 0
  6. 2026Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrievalcited by 0