A Proposed Conceptual Framework for a Representational Approach to Information Retrieval
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
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2019Passage Re-ranking with BERTcited by 629
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 504
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
27 more
- 2018QuAC : Question Answering in Contextcited by 379
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2017Efficient Natural Language Response Suggestion for Smart Replycited by 228
- 2019Poly-encoders: Transformer Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoringcited by 164
- 2020Embedding-based Retrieval in Facebook Searchcited by 155
- 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
- 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
- 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
- 2021Learning Passage Impacts for Inverted Indexescited by 68
- 2019Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrievalcited by 65
- 2021Efficient Passage Retrieval with Hashing for Open-domain Question Answeringcited by 53
- 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45
- 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
- 2021A Replication Study of Dense Passage Retrievercited by 37
- 2021Pre-trained Language Model based Ranking in Baidu Searchcited by 33
- 2020A Memory Efficient Baseline for Open Domain Question Answeringcited by 32
- 2017Cascade Ranking for Operational E-commerce Searchcited by 29
- 2020Complementing Lexical Retrieval with Semantic Residual Embeddingcited by 27
- 2021Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansioncited by 20
- 2020Flexible retrieval with NMSLIB and FlexNeuARTcited by 14
- 2017Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systemscited by 5
- 2015Assessing Efficiency-Effectiveness Tradeoffs in Multi-Stage Retrieval Systems Without Using Relevance Judgmentscited by 4
- 2019Lucene for Approximate Nearest-Neighbors Search on Arbitrary Dense Vectorscited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 9; 2023: 6; 2024: 0; 2025: 4; 2026: 4.
24 papers.
Sort:
By area:
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
- 2023RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Modelscited by 69
- 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 47
- 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Methodcited by 29
- 2023Large Search Model: Redefining Search Stack in the Era of LLMscited by 18
- 2023Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboardcited by 15
- 2025Enhancing Lexicon-Based Text Embeddings with Large Language Modelscited by 6
- 2021Sparsifying Sparse Representations for Passage Retrieval by Top-k Maskingcited by 5
- 2022Query Expansion Using Contextual Clue Sampling with Language Modelscited by 5
- 2022Establishing Strong Baselines for TripClick Health Retrievalcited by 4
- 2023Simple Yet Effective Neural Ranking and Reranking Baselines for Cross-Lingual Information Retrievalcited by 4
- 2023Adapting Learned Sparse Retrieval for Long Documentscited by 3
12 more
- 2025Practical Code RAG at Scale: Task-Aware Retrieval Design Choices under Compute Budgetscited by 3
- 2022Asyncval: A Toolkit for Asynchronously Validating Dense Retriever Checkpoints during Trainingcited by 2
- 2022Knowledge Base Index Compression via Dimensionality and Precision Reductioncited by 2
- 2025CLIRudit: Cross-Lingual Information Retrieval of Scientific Documentscited by 2
- 2022Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Rankingcited by 1
- 2022Bridging the Training-Inference Gap for Dense Phrase Retrievalcited by 1
- 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLMcited by 1
- 2022Sparse and Dense Approaches for the Full-rank Retrieval of Responses for Dialoguescited by 0
- 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrievalcited by 0
- 2026SentAttack: A Sentence-Level Black-Box Adversarial Attack Method for Dense Retrieval Modelscited by 0
- 2026An Agentic Framework Using Rules and LLMs for Embedding and Annotating Descriptive Document Layouts: A Plant Science Use Casecited by 0
- 2026Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Searchcited by 0
- 2026Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Search8 Oct 2026
- 2026SentAttack: A Sentence-Level Black-Box Adversarial Attack Method for Dense Retrieval Models3 Jul 2026
- 2026An Agentic Framework Using Rules and LLMs for Embedding and Annotating Descriptive Document Layouts: A Plant Science Use Case19 Jun 2026
- 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrieval24 Jan 2026
- 2025Practical Code RAG at Scale: Task-Aware Retrieval Design Choices under Compute Budgets23 Oct 2025
- 2025Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM2 Sep 2025
- 2025CLIRudit: Cross-Lingual Information Retrieval of Scientific Documents22 Apr 2025
- 2025Enhancing Lexicon-Based Text Embeddings with Large Language Models16 Jan 2025
- 2023Large Search Model: Redefining Search Stack in the Era of LLMs23 Oct 2023
- 2023RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models26 Sep 2023
- 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Method19 Aug 2023
- 2023Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard13 Jun 2023
12 more
- 2023Adapting Learned Sparse Retrieval for Long Documents29 May 2023
- 2023Simple Yet Effective Neural Ranking and Reranking Baselines for Cross-Lingual Information Retrieval3 Apr 2023
- 2022Bridging the Training-Inference Gap for Dense Phrase Retrieval25 Oct 2022
- 2022Query Expansion Using Contextual Clue Sampling with Language Models13 Oct 2022
- 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generation21 Jun 2022
- 2022PLAID: An Efficient Engine for Late Interaction Retrieval19 May 2022
- 2022Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking19 May 2022
- 2022Sparse and Dense Approaches for the Full-rank Retrieval of Responses for Dialogues22 Apr 2022
- 2022Knowledge Base Index Compression via Dimensionality and Precision Reduction6 Apr 2022
- 2022Asyncval: A Toolkit for Asynchronously Validating Dense Retriever Checkpoints during Training25 Feb 2022
- 2022Establishing Strong Baselines for TripClick Health Retrieval2 Jan 2022
- 2021Sparsifying Sparse Representations for Passage Retrieval by Top-k Masking17 Dec 2021
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
- 2023RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Modelscited by 69
- 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 47
- 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Methodcited by 29
- 2023Large Search Model: Redefining Search Stack in the Era of LLMscited by 18
- 2023Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboardcited by 15
- 2025Enhancing Lexicon-Based Text Embeddings with Large Language Modelscited by 6
- 2021Sparsifying Sparse Representations for Passage Retrieval by Top-k Maskingcited by 5
- 2022Query Expansion Using Contextual Clue Sampling with Language Modelscited by 5
- 2022Establishing Strong Baselines for TripClick Health Retrievalcited by 4
- 2023Simple Yet Effective Neural Ranking and Reranking Baselines for Cross-Lingual Information Retrievalcited by 4
- 2023Adapting Learned Sparse Retrieval for Long Documentscited by 3
12 most cited of 21 All 21 (JSON)
- 2026Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Search8 Oct 2026
- 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrieval24 Jan 2026
- 2025Practical Code RAG at Scale: Task-Aware Retrieval Design Choices under Compute Budgets23 Oct 2025
- 2025CLIRudit: Cross-Lingual Information Retrieval of Scientific Documents22 Apr 2025
- 2025Enhancing Lexicon-Based Text Embeddings with Large Language Models16 Jan 2025
- 2023Large Search Model: Redefining Search Stack in the Era of LLMs23 Oct 2023
- 2023RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models26 Sep 2023
- 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Method19 Aug 2023
- 2023Resources for Brewing BEIR: Reproducible Reference Models and an Official Leaderboard13 Jun 2023
- 2023Adapting Learned Sparse Retrieval for Long Documents29 May 2023
- 2023Simple Yet Effective Neural Ranking and Reranking Baselines for Cross-Lingual Information Retrieval3 Apr 2023
- 2022Bridging the Training-Inference Gap for Dense Phrase Retrieval25 Oct 2022
12 newest of 21 All 21 (JSON)