Cited by 393Information Retrieval and Search BehaviorTopic ModelingAdvanced Image and Video Retrieval Techniques

Sparse, Dense, and Attentional Representations for Text Retrieval

Open access
Luan, Yi, Eisenstein, Jacob, Toutanova, Kristina, Collins, Michael·2021·Transactions of the Association for Computational Linguistics

Abstract

Abstract Dual encoders perform retrieval by encoding documents and queries into dense low-dimensional vectors, scoring each document by its inner product with the query. We investigate the capacity of this architecture relative to sparse bag-of-words models and attentional neural networks. Using both theoretical and empirical analysis, we establish connections between the encoding dimension, the margin between gold and lower-ranked documents, and the document length, suggesting limitations in the capacity of fixed-length encodings to support precise retrieval of long documents. Building on these insights, we propose a simple neural model that combines the efficiency of dual encoders with some of the expressiveness of more costly attentional architectures, and explore sparse-dense hybrids to capitalize on the precision of sparse retrieval. These models outperform strong alternatives in large-scale retrieval.

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.1162/tacl_a_00369

Cites

58 of 58 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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Two primary retrieval methods are suitable for non-parametric memory: sparse methods based on bag-of-words models and dense methods based on deep representation learning.

    “Based on our review of existing work, we identify two primary retrieval methods suitable for non-parametric memory including sparse methods based on bag-of-words models and dense methods based on deep representation learning for vector encoding and relevance score calculation [269, 270, 232, 271].”

    From Human-inspired Perspectives: A Survey on AI Long-term Memory (2024) · cites this paper as [270]

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 61 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. Zhuyun Dai and Jamie Callan. 2020a. Contextaware document term weighting for ad-hoc search. In Proceedings of The Web Conference 2020 .
  2. Samuel Humeau, Kurt Shuster, Marie-Anne Lachaux, and Jason Weston. 2020. Polyencoders: Transformer architectures and pretraining strategies for fast and accurate multi- sentence scoring. In Proceedings of the International Conference on Learning Representations (ICLR) .
  3. Omar Khattab and Matei Zaharia. 2020. ColBERT. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval .

Cited by

Sorted by citations

Authors
Luan, Y., Eisenstein, J., Toutanova, K., & Collins, M.
Affiliations
Google (United States) (US)
Corresponding author
  • Luan, Yi
  • Eisenstein, Jacob
  • Toutanova, Kristina
  • Collins, Michael
Venue
Transactions of the Association for Computational Linguistics
Published
2021
Volume
9
Pages
329-345
ISSN
2307-387X (ISSN-L)
OpenAlex
W3157758108
Cited by
363
References
61
Citations by year
2026: 46 · 2025: 48 · 2024: 39 · 2023: 81 · 2022: 69 · 2021: 61 · 2020: 19
FWCI
56.52
Type
journal article
Language
en
Open access
Locations
  • Transactions of the Association for Computational Linguistics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
Keywords
text retrieval, dual-encoder models, sparse retrieval, bag-of-words model, document length, retrieval precision, large-scale retrieval

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