Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning
ECoRAG: Evidentiality-guided Compression for Long Context RAG
Efficient Context Selection for Long-Context QA: No Tuning, No Iteration, Just Adaptive-$k$
Answer Complex Questions: Path Ranker Is All You Need
From Roots to Rewards: Dynamic Tree Reasoning with RL
Arctic Inference with Shift Parallelism: Fast and Efficient Open Source Inference System for Enterprise AI
토론
이 논문과 연결된 포럼 글이 아직 없습니다.