Cited by 102Topic ModelingInformation Retrieval and Search BehaviorMultimodal Machine Learning Applications

Simple Entity-Centric Questions Challenge Dense Retrievers

Open access
Sciavolino, Christopher, Zhong, Zexuan, Lee, Jinhyuk, Chen, Danqi·2021·Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing

Abstract

Open-domain question answering has exploded in popularity recently due to the success of dense retrieval models, which have surpassed sparse models using only a few supervised training examples.However, in this paper, we demonstrate current dense models are not yet the holy grail of retrieval.We first construct EntityQuestions, a set of simple, entityrich questions based on facts from Wikidata (e.g., "Where was Arve Furset born?"), and observe that dense retrievers drastically underperform sparse methods.We investigate this issue and uncover that dense retrievers can only generalize to common entities unless the question pattern is explicitly observed during training.We discuss two simple solutions towards addressing this critical problem.First, we demonstrate that data augmentation is unable to fix the generalization problem.Second, we argue a more robust passage encoder helps facilitate better question adaptation using specialized question encoders.We hope our work can shed light on the challenges in creating a robust, universal dense retriever that works well across different input distributions. 1

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2021.emnlp-main.496

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 33 references couldn’t be matched to a known paper.

Research works printed but not linked: 2

  1. Hady Elsahar, Pavlos Vougiouklis, Arslen Remaci, Christophe Gravier, Jonathon Hare, Frederique Laforest, and Elena Simperl. 2018. T-REx: A large scale alignment of natural language with knowledge base triples. In Proceedings of the Eleventh Interna- tional Conference on Language Resources and Eval- uation (LREC 2018), Miyazaki, Japan. European Language Resources Association (ELRA).
  2. Nandan Thakur, Nils Reimers, Andreas Rücklé, Ab- hishek Srivastava, and Iryna Gurevych. 2021. BEIR: A heterogenous benchmark for zero-shot evaluation of information retrieval models. ArXiv preprint, abs/2104.08663. · arXiv

Cited by

Sorted by citations

Authors
Sciavolino, C., Zhong, Z., Lee, J., & Chen, D.
Affiliations
Princeton University (US)
Venue
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Published
2021
Pages
6138-6148
OpenAlex
W3201233724
Cited by
98
References
33
Citations by year
2026: 12 · 2025: 15 · 2024: 16 · 2023: 33 · 2022: 20 · 2021: 2
FWCI
7.92
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, public-domain)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
Keywords
dense retrieval, open-domain question answering, Wikidata, data augmentation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review