Hannaneh Hajishirzi, Ikuya Yamada, Akari Asai, † Studio, Ousia Riken
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Most state-of-the-art open-domain question answering systems use a neural retrieval model to encode passages into continuous vectors and extract them from a knowledge source. However, such retrieval models often require large memory to run because of the massive size of their passage index. In this paper, we introduce Binary Passage Retriever (BPR), a memory-efficient neural retrieval model that integrates a learning-to-hash technique into the state-of-the-art Dense Passage Retriever (DPR) (Karpukhin et al., 2020) to represent the passage index using compact binary codes rather than continuous vectors. BPR is trained with a multi-task objective over two tasks: efficient candidate generation based on binary codes and accurate reranking based on continuous vectors. Compared with DPR, BPR substantially reduces the memory cost from 65GB to 2GB without a loss of accuracy on two standard open-domain question answering benchmarks: Natural Questions and TriviaQA. Our code and trained models are available at https://github.com/studio-ousia/ bpr.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.00882")
get_code_for_paper("2106.00882")
have("2106.00882")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.00882.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.00882)
Connect an agent — have() is free.