mlsanityData to 7 Oct 2026

A Proposed Conceptual Framework for a Representational Approach to Information Retrieval

arXiv 2110.01529 ↗First posted 4 Oct 2021cs.IR cs.CLcited by 24

Not on the map. Why?

Abstract (arXiv)

This paper outlines a conceptual framework for understanding recent developments in information retrieval and natural language processing that attempts to integrate dense and sparse retrieval methods. I propose a representational approach that breaks the core text retrieval problem into a logical scoring model and a physical retrieval model. The scoring model is defined in terms of encoders, which map queries and documents into a representational space, and a comparison function that computes query-document scores. The physical retrieval model defines how a system produces the top-k scoring documents from an arbitrarily large corpus with respect to a query. The scoring model can be further analyzed along two dimensions: dense vs. sparse representations and supervised (learned) vs. unsupervised approaches. I show that many recently proposed retrieval methods, including multi-stage ranking designs, can be seen as different parameterizations in this framework, and that a unified view suggests a number of open research questions, providing a roadmap for future work. As a bonus, this conceptual framework establishes connections to sentence similarity tasks in natural language processing and information access "technologies" prior to the dawn of computing.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). Builds on 39 of its 88 references that are in the map. First posted on arXiv 4 Oct 2021.

Builds on

39 of 88 references.

References · 39

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  4. 2017Billion-scale similarity search with GPUscited by 2,477
  5. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  6. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  7. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  8. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  9. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  10. 2019Passage Re-ranking with BERTcited by 629
  11. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 504
  12. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
27 more
  1. 2018QuAC : Question Answering in Contextcited by 379
  2. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
  3. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
  4. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  5. 2017Efficient Natural Language Response Suggestion for Smart Replycited by 228
  6. 2019Poly-encoders: Transformer Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoringcited by 164
  7. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  8. 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
  9. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
  10. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
  11. 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
  12. 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
  13. 2021Learning Passage Impacts for Inverted Indexescited by 68
  14. 2019Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrievalcited by 65
  15. 2021Efficient Passage Retrieval with Hashing for Open-domain Question Answeringcited by 53
  16. 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45
  17. 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
  18. 2021A Replication Study of Dense Passage Retrievercited by 37
  19. 2021Pre-trained Language Model based Ranking in Baidu Searchcited by 33
  20. 2020A Memory Efficient Baseline for Open Domain Question Answeringcited by 32
  21. 2017Cascade Ranking for Operational E-commerce Searchcited by 29
  22. 2020Complementing Lexical Retrieval with Semantic Residual Embeddingcited by 27
  23. 2021Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansioncited by 20
  24. 2020Flexible retrieval with NMSLIB and FlexNeuARTcited by 14
  25. 2017Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systemscited by 5
  26. 2015Assessing Efficiency-Effectiveness Tradeoffs in Multi-Stage Retrieval Systems Without Using Relevance Judgmentscited by 4
  27. 2019Lucene for Approximate Nearest-Neighbors Search on Arbitrary Dense Vectorscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 9; 2023: 6; 2024: 0; 2025: 4; 2026: 4.

24 papers.

Sort:

By area:

  1. 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
  2. 2023RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Modelscited by 69
  3. 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 47
  4. 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Methodcited by 29
  5. 2023Large Search Model: Redefining Search Stack in the Era of LLMscited by 18
  6. 2023Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboardcited by 15
  7. 2025Enhancing Lexicon-Based Text Embeddings with Large Language Modelscited by 6
  8. 2021Sparsifying Sparse Representations for Passage Retrieval by Top-k Maskingcited by 5
  9. 2022Query Expansion Using Contextual Clue Sampling with Language Modelscited by 5
  10. 2022Establishing Strong Baselines for TripClick Health Retrievalcited by 4
  11. 2023Simple Yet Effective Neural Ranking and Reranking Baselines for Cross-Lingual Information Retrievalcited by 4
  12. 2023Adapting Learned Sparse Retrieval for Long Documentscited by 3
12 more
  1. 2025Practical Code RAG at Scale: Task-Aware Retrieval Design Choices under Compute Budgetscited by 3
  2. 2022Asyncval: A Toolkit for Asynchronously Validating Dense Retriever Checkpoints during Trainingcited by 2
  3. 2022Knowledge Base Index Compression via Dimensionality and Precision Reductioncited by 2
  4. 2025CLIRudit: Cross-Lingual Information Retrieval of Scientific Documentscited by 2
  5. 2022Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Rankingcited by 1
  6. 2022Bridging the Training-Inference Gap for Dense Phrase Retrievalcited by 1
  7. 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLMcited by 1
  8. 2022Sparse and Dense Approaches for the Full-rank Retrieval of Responses for Dialoguescited by 0
  9. 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrievalcited by 0
  10. 2026SentAttack: A Sentence-Level Black-Box Adversarial Attack Method for Dense Retrieval Modelscited by 0
  11. 2026An Agentic Framework Using Rules and LLMs for Embedding and Annotating Descriptive Document Layouts: A Plant Science Use Casecited by 0
  12. 2026Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Searchcited by 0