Lune

EMNLP2024Top-tier venue

Evaluating D-MERIT of Partial-annotation on Information Retrieval

Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg

Abstract

Retrieval models are often evaluated on partially-annotated datasets. Each query is mapped to a few relevant texts and the remaining corpus is assumed to be irrelevant. As a result, models that successfully retrieve falsely labeled negatives are punished in evaluation. Unfortunately, completely annotating all texts for every query is not resource efficient. In this work, we show that using partially-annotated datasets in evaluation can paint a distorted picture. We curate D-MERIT, a passage retrieval evaluation set from Wikipedia, aspiring to contain all relevant passages for each query. Queries describe a group (e.g., "journals about linguistics") and relevant passages are evidence that entities belong to the group (e.g., a passage indicating that Language is a journal about linguistics). We show that evaluating on a dataset containing annotations for only a subset of the relevant passages might result in misleading ranking of the retrieval systems and that as more relevant texts are included in the evaluation set, the rankings converge. We propose our dataset as a resource for evaluation and our study as a recommendation for balance between resource-efficiency and reliable evaluation when annotating evaluation sets for text retrieval. Our dataset can be downloaded from https://D-MERIT.github.io .

Ask Lune

Ask anything. The answer quotes the paper.

Lune reads all of it and the papers around it, then shows you the passages behind every answer.

Questions to start from

Lune answers from

the full paper · related work

Get the answer

Free to start. No credit card required.

Builds on6

  1. Dense Passage Retrieval for Open-Domain Question AnsweringVladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis et al.EMNLP 2020 · 142 citations
  2. RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-EncoderShitao Xiao, Zheng Liu, Yingxia Shao, Zhao CaoEMNLP 2022 · 63 citations
  3. QUEST: A Retrieval Dataset of Entity-Seeking Queries with Implicit Set OperationsChaitanya Malaviya, Peter Shaw, Ming-Wei Chang, Kenton Lee et al.ACL 2023 · 11 citations
  4. RoMQA: A Benchmark for Robust, Multi-evidence, Multi-answer Question AnsweringVictor Zhong, Weijia Shi, Wen-tau Yih, Luke ZettlemoyerEMNLP Findings 2023 · 8 citations
  5. NERetrieve: Dataset for Next Generation Named Entity Recognition and RetrievalUri Katz, Matan Vetzler, Amir David Nissan Cohen, Yoav GoldbergEMNLP Findings 2023 · 7 citations

Related papers

  1. DuReader-Retrieval: A Large-scale Chinese Benchmark for Passage Retrieval from Web Search EngineYifu Qiu, Hongyu Li, Yingqi Qu, Ying Chen et al.EMNLP 2022 · 10 citations
  2. Hard Negatives, Hard Lessons: Revisiting Training Data Quality for Robust Information Retrieval with LLMsNandan Thakur, Crystina Zhang, Xueguang Ma, Jimmy LinEMNLP Findings 2025 · 4 citations
  3. Cross-document Event Coreference Search: Task, Dataset and ModelingAlon Eirew, Avi Caciularu, Ido DaganEMNLP 2022 · 3 citations
  4. Mitigating False-Negative Contexts in Multi-document Question Answering with Retrieval MarginalizationAnsong Ni, Matt Gardner, Pradeep DasigiEMNLP 2021 · 5 citations
  5. WatClaimCheck: A new Dataset for Claim Entailment and InferenceKashif Khan, Ruizhe Wang, Pascal PoupartACL 2022
Dusk over the sea between two cliffs drawn in fine vertical lines