Exploiting Sentence-Level Representations for Passage Ranking
Recently, pre-trained contextual models, such as BERT, have shown to perform well in language related tasks. We revisit the design decisions that govern the applicability of these models for the passage re-ranking task in open-domain question answering. We find that common approaches in the literature rely on fine-tuning a pre-trained BERT model and using a single, global representation of the input, discarding useful fine-grained relevance signals in token- or sentence-level representations. We argue that these discarded tokens hold useful information that can be leveraged. In this paper, we explicitly model the sentence-level representations by using Dynamic Memory Networks (DMNs) and conduct empirical evaluation to show improvements in passage re-ranking over fine-tuned vanilla BERT models by memory-enhanced explicit sentence modelling on a diverse set of open-domain QA datasets. We further show that freezing the BERT model and only training the DMN layer still comes close to the original performance, while improving training efficiency drastically. This indicates that the usual fine-tuning step mostly helps to aggregate the inherent information in a single output token, as opposed to adapting the whole model to the new task, and only achieves rather small gains.
Code (1)
Tasks
Open-Domain Question AnsweringPassage RankingPassage Re-RankingQuestion AnsweringRe-RankingSentenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Simple Approach to Jointly Rank Passages and Select Relevant Sentences in the OBQA Context
In the open book question answering (OBQA) task, selecting the relevant passages and sentences from distracting information is crucial to reason the answer to a question. HotpotQA dataset is designed to teach and evaluat…
Passage RankingQuestion AnsweringSentenceA Study on Passage Re-ranking in Embedding based Unsupervised Semantic Search
State of the art approaches for (embedding based) unsupervised semantic search exploits either compositional similarity (of a query and a passage) or pair-wise word (or term) similarity (from the query and the passage). …
Passage Re-RankingRe-RankingSentenceSentence Embedding+1In Situ Answer Sentence Selection at Web-scale
Current answer sentence selection (AS2) applied in open-domain question answering (ODQA) selects answers by ranking a large set of possible candidates, i.e., sentences, extracted from the retrieved text. In this paper, w…
Multi-Task LearningOpen-Domain Question AnsweringQuestion AnsweringReranking+1Text-to-Text Multi-view Learning for Passage Re-ranking
Recently, much progress in natural language processing has been driven by deep contextualized representations pretrained on large corpora. Typically, the fine-tuning on these pretrained models for a specific downstream t…
MULTI-VIEW LEARNINGPassage RankingPassage Re-RankingRe-Ranking+2Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval
Term frequency is a common method for identifying the importance of a term in a query or document. But it is a weak signal, especially when the frequency distribution is flat, such as in long queries or short documents w…
Passage RetrievalRetrievalSentence