EfficientQA : a RoBERTa Based Phrase-Indexed Question-Answering System
This research provides a more resource-efficient approach to open-domain question-answering for real-world applications by reducing the computational burden of large language models.
The authors developed EfficientQA, a RoBERTa-based system that translates natural language understanding into dense vectors for questions and answer candidates, enabling question-answering via nearest neighbor search. This model achieved state-of-the-art results in Phrase-Indexed Question Answering (PIQA), surpassing the previous best by 1.3 points in exact-match and 1.4 points in f1-score.
State-of-the-art extractive question-answering models achieve superhuman performances on the SQuAD benchmark. Yet, they are unreasonably heavy and need expensive GPU computing to answer questions in a reasonable time. Thus, they cannot be used in the open-domain question-answering paradigm for real-world queries on hundreds of thousands of documents. In this paper, we explore the possibility of transferring the natural language understanding of language models into dense vectors representing questions and answer candidates to make question-answering compatible with a simple nearest neighbor search task. This new model, which we call EfficientQA, takes advantage of the pair of sequences kind of input of BERT-based models to build meaningful, dense representations of candidate answers. These latter are extracted from the context in a question-agnostic fashion. Our model achieves state-of-the-art results in Phrase-Indexed Question Answering (PIQA), beating the previous state-of-art by 1.3 points in exact-match and 1.4 points in f1-score. These results show that dense vectors can embed rich semantic representations of sequences, although these were built from language models not originally trained for the use case. Thus, to build more resource-efficient NLP systems in the future, training language models better adapted to build dense representations of phrases is one of the possibilities.