Existing open-domain question answering (QA) models are not suitable for
real-time usage because they need to process several long documents on-demand
for every input query. In this paper, we introduce the query-agnostic indexable
representation of document phrases that can drastically speed up open-domain QA
and also allows us to reach long-tail targets. In particular, our dense-sparse
phrase encoding effectively captures syntactic, semantic, and lexical
information of the phrases and eliminates the pipeline filtering of context
documents. Leveraging optimization strategies, our model can be trained in a
single 4-GPU server and serve entire Wikipedia (up to 60 billion phrases) under
2TB with CPUs only. Our experiments on SQuAD-Open show that our model is more
accurate than DrQA (Chen et al., 2017) with 6000x reduced computational cost,
which translates into at least 58x faster end-to-end inference benchmark on
CPUs.

本文提出了一种查询不可知的可索引文档短语表示，该表示可以大大加速开放域问答，并允许我们达到长尾目标。实验证明，该模型的计算成本降低了 6,000 倍，并且比 DrQA 更准确，可以在 CPU 上实现最快 58 倍的端到端推理基准。