---
title: 'Dense Passage Retrieval for Open-Domain Question Answering'
license: CC-BY-4.0
license_url: https://creativecommons.org/licenses/by/4.0/
license_note: 'This note is CC BY 4.0. It links to the paper and does not reproduce it. Paper license: arXiv non-exclusive distribution (verified on arXiv abs page 2026-11-11; http://arxiv.org/licenses/nonexclusive-distrib/1.0/).'
source: https://iinventedlight.com/library/notes/2004-04906-dpr.md
source_license: 'arXiv default (non-exclusive distribution license)'
attribution: 'Pointer note by iinventedlight (AI-assisted). Links to: Vladimir Karpukhin, Barlas Oğuz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, Wen-tau Yih, Dense Passage Retrieval for Open-Domain Question Answering (arXiv). This note does not reproduce the paper.'
author: 'iinventedlight (AI-assisted)'
date: 2026-11-11
status: published
approved_by: "Cole Withington, 2026-11-11 20:58 PT, Grok Bot chat widget t1717s7407: \"Publish all 100 including the LLMs Encode Clinical Knowledge note\""
checked_on: 2026-11-11
as_of: 2026-11-11
confidence: medium
untested: 'Pointer note only. Abs page read 2026-11-11. The paper is not reproduced here.'
category: arxiv
topic_area: 'ai-research: RAG'
tags: arxiv, pointer, RAG, retrieval
arxiv_id: 2004.04906
alias: 2004.04906-dpr
format: pointer
type: pointer
sources:
  - id: S1
    title: 'Dense Passage Retrieval for Open-Domain Question Answering'
    publisher: arXiv
    authors: 'Vladimir Karpukhin, Barlas Oğuz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, Wen-tau Yih'
    url: https://arxiv.org/abs/2004.04906
    version_read: 'v3 (30 Sep 2020)'
    accessed: 2026-11-11
    license: 'arXiv default (non-exclusive distribution license)'
---
# Dense Passage Retrieval for Open-Domain Question Answering

## Summary
Dense Passage Retrieval for Open-Domain Question Answering (2020), by Vladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, and Wen-tau Yih, is at https://arxiv.org/abs/2004.04906. At the time, open-domain question answering usually relied on sparse retrievers such as TF-IDF or BM25. The authors show that retrieval can be done with dense vectors alone, learning embeddings from a small number of questions and passages in a simple dual-encoder framework. They report that this dense retriever outperforms a strong Lucene-BM25 system by 9% to 19% absolute on top-20 passage retrieval accuracy across a range of open-domain QA datasets, and that the improved retrieval helped their end-to-end QA system set new state-of-the-art results on multiple benchmarks. When evaluated on a wide range of open-domain QA datasets, the dense retriever outperforms a strong Lucene-BM25 system largely by 9% to 19% absolute in terms of top-20 passage retrieval accuracy, and helps their end-to-end QA system establish new state-of-the-art on multiple open-domain QA benchmarks. Title, authors, abstract, and comments were taken from the arXiv abs page. The version is v3 (30 Sep 2020), submitted 10 Apr 2020.

## Claims
Pointer notes do not quote the paper. See Verification and Sources for the link and license.

## Verification
- Format: pointer note only. The paper is not reproduced here.
- Why it matters: It matters because it established the dual-encoder recipe that most later neural retrievers still follow.
- Reproduced: not reproduced (2026-11-11).
- Related work: Related notes already in the library include [RAG basics](https://iinventedlight.com/library/notes/genai-rag-embeddings-vector-search/) and [Self-RAG](https://iinventedlight.com/library/notes/2310-11511-self-rag/).
- Limits: This is a pointer note only. The 9% to 19% top-20 gains are the authors' reported results versus Lucene-BM25 from the v3 paper (30 Sep 2020).
- License: arXiv default (non-exclusive distribution license) on the abs page (2026-11-11; http://arxiv.org/licenses/nonexclusive-distrib/1.0/). Submitted 10 Apr 2020 (v1); last revised 30 Sep 2020 (v3). Sources: [S1] https://arxiv.org/abs/2004.04906, v3 (30 Sep 2020). checked_on: 2026-11-11. Paper license: arXiv non-exclusive distribution; this note links to it and does not reproduce it. The note itself is CC BY 4.0.

## When to apply
Use when you need the original Dense Passage Retrieval paper, the standard dual-encoder recipe behind many later neural retrievers.

## Facts
- id: F1
  claim: 'Dense Passage Retrieval learns embeddings from questions and passages with a simple dual-encoder framework, and shows that retrieval can be implemented using dense representations alone.'
  confidence: medium
  date: 2026-11-11
  sources: [S1]
  license: CC-BY-4.0
- id: F2
  claim: 'The authors report that the dense retriever outperforms a strong Lucene-BM25 system by 9% to 19% absolute in top-20 passage retrieval accuracy on a range of open-domain QA datasets.'
  confidence: medium
  date: 2026-11-11
  sources: [S1]
  license: CC-BY-4.0
- id: F3
  claim: 'They report that this retrieval helped their end-to-end QA system establish new state-of-the-art results on multiple open-domain QA benchmarks.'
  confidence: medium
  date: 2026-11-11
  sources: [S1]
  license: CC-BY-4.0

## Sources
- [S1] arXiv 2004.04906, https://arxiv.org/abs/2004.04906. Paper license: arXiv default (non-exclusive distribution license). v3 (30 Sep 2020). Accessed 2026-11-11. This note links to the paper and does not reproduce it.

License: this note is CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). Pointer by iinventedlight (AI-assisted). Paper license: arXiv non-exclusive distribution; this note links to it and does not reproduce it.

---

Agents: [/agents.md](/agents.md) | [/.well-known/agent-library.json](/.well-known/agent-library.json).