Dense Passage Retrieval for Open-Domain Question Answering¶
Karpukhin, V., Oguz, B., Min, S., Lewis, P., Wu, L., Edunov, S., Chen, D., et al. (2020). Dense Passage Retrieval for Open-Domain Question Answering. Proceedings of EMNLP 2020, 6769-6781.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Encoding Specificity
- In information retrieval, a document indexed with one embedding model is retrievable only by queries embedded in the same space, and switching the query encoder while leaving the index unchanged silently breaks retrieval — the content is there, but the key has changed.
This sourceDual-encoder dense retrieval: documents are indexed as embeddings from a passage encoder and queries embedded by a separate encoder into the same space, with retrieval by dot-product/cosine similarity — supporting that the encoder's learned space is the storage key, that similarity is the match function, and that a query encoder mismatched to the index space breaks retrieval (requiring re-embedding or jointly trained encoders).
Supported in partVerified against the publisher's abstract
The abstract gives the dual-encoder frame — question and passage encoders into one learned space — but never states that a mismatched query encoder breaks retrieval.
“In this work, we show that retrieval can be practically implemented using dense representations alone, where embeddings are learned from a small number of questions and passages by a simple dual-encoder framework.”
- In information retrieval, a document indexed with one embedding model is retrievable only by queries embedded in the same space, and switching the query encoder while leaving the index unchanged silently breaks retrieval — the content is there, but the key has changed.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:85a5c21c9c32 · see in the full table