Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Combining Lexical and Dense Retrieval for Computationally Efficient Multi-hop Question Answering (2106.08433v2)

Published 15 Jun 2021 in cs.IR

Abstract: In simple open-domain question answering (QA), dense retrieval has become one of the standard approaches for retrieving the relevant passages to infer an answer. Recently, dense retrieval also achieved state-of-the-art results in multi-hop QA, where aggregating information from multiple pieces of information and reasoning over them is required. Despite their success, dense retrieval methods are computationally intensive, requiring multiple GPUs to train. In this work, we introduce a hybrid (lexical and dense) retrieval approach that is highly competitive with the state-of-the-art dense retrieval models, while requiring substantially less computational resources. Additionally, we provide an in-depth evaluation of dense retrieval methods on limited computational resource settings, something that is missing from the current literature.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Georgios Sidiropoulos (7 papers)
  2. Nikos Voskarides (12 papers)
  3. Svitlana Vakulenko (31 papers)
  4. Evangelos Kanoulas (79 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.