Dense Retrieval
Also called semantic search, embedding-based retrieval, DPR, bi-encoder retrieval.
Dense retrieval finds relevant passages by embedding the query and every passage as dense vectors, usually with a dual encoder, and returning the passages whose vectors are most similar to the query's.
Description
Because it matches on meaning rather than shared words, dense retrieval finds paraphrases and related concepts that keyword search misses. It can miss exact identifiers, rare names, and codes, which is why production systems often combine it with BM25 in hybrid search and refine results with a reranker.
Sources
- Karpukhin et al. (2020). Dense Passage Retrieval for Open-Domain Question Answering.
Cite this entry
Protologue. (2026). Dense Retrieval. In Protologue: A Taxonomy of Prompting and LLM Techniques (v1.4.0, PTL-0126). https://protologue.com/t/dense-retrieval/
BibTeX
@misc{protologue_dense_retrieval,
title = {Dense Retrieval},
author = {{Protologue}},
year = {2026},
howpublished = {Protologue: A Taxonomy of Prompting and LLM Techniques, v1.4.0},
note = {Entry PTL-0126},
url = {https://protologue.com/t/dense-retrieval/}
}New terms, as they're coined
One email a week with the newest techniques, each defined and sourced like this entry.
Delivered through Beehiiv. Unsubscribe from any issue.