A Memory Efficient Baseline for Open Domain Question Answering

12/30/2020
by   Gautier Izacard, et al.
0

Recently, retrieval systems based on dense representations have led to important improvements in open-domain question answering, and related tasks. While very effective, this approach is also memory intensive, as the dense vectors for the whole knowledge source need to be kept in memory. In this paper, we study how the memory footprint of dense retriever-reader systems can be reduced. We consider three strategies to reduce the index size: dimension reduction, vector quantization and passage filtering. We evaluate our approach on two question answering benchmarks: TriviaQA and NaturalQuestions, showing that it is possible to get competitive systems using less than 6Gb of memory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2021

Efficient Passage Retrieval with Hashing for Open-domain Question Answering

Most state-of-the-art open-domain question answering systems use a neura...
research
04/06/2022

Knowledge Base Index Compression via Dimensionality and Precision Reduction

Recently neural network based approaches to knowledge-intensive NLP task...
research
09/28/2020

SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval

We introduce SPARTA, a novel neural retrieval method that shows great pr...
research
10/12/2021

Mention Memory: incorporating textual knowledge into Transformers through entity mention attention

Natural language understanding tasks such as open-domain question answer...
research
03/15/2018

Word2Bits - Quantized Word Vectors

Word vectors require significant amounts of memory and storage, posing i...
research
01/25/2023

Pre-computed memory or on-the-fly encoding? A hybrid approach to retrieval augmentation makes the most of your compute

Retrieval-augmented language models such as Fusion-in-Decoder are powerf...
research
12/28/2020

Causal Perception in Question-Answering Systems

Root cause analysis is a common data analysis task. While question-answe...

Please sign up or login with your details

Forgot password? Click here to reset