paper-with-me

홈 › Papers

On Single and Multiple Representations in Dense Passage Retrieval

2021-08-13 · Craig Macdonald, Nicola Tonellotto, Iadh Ounis

The advent of contextualised language models has brought gains in search effectiveness, not just when applied for re-ranking the output of classical weighting models such as BM25, but also when used directly for passage indexing and retrieval, a technique which is called dense retrieval. In the existing literature in neural ranking, two dense retrieval families have become apparent: single representation, where entire passages are represented by a single embedding (usually BERT's [CLS] token, as exemplified by the recent ANCE approach), or multiple representations, where each token in a passage is represented by its own embedding (as exemplified by the recent ColBERT approach). These two families have not been directly compared. However, because of the likely importance of dense retrieval moving forward, a clear understanding of their advantages and disadvantages is paramount. To this end, this paper contributes a direct study on their comparative effectiveness, noting situations where each method under/over performs w.r.t. each other, and w.r.t. a BM25 baseline. We observe that, while ANCE is more efficient than ColBERT in terms of response time and memory usage, multiple representations are statistically more effective than the single representations for MAP and MRR@10. We also show that multiple representations obtain better improvements than single representations for queries that are the hardest for BM25, as well as for definitional queries, and those with complex information needs.

📄 PDF Abstract BibTeX arXiv:2108.06279

Code (1)

terrierteam/pyterrier_colbert 공식 구현 pytorch

Tasks

Passage RetrievalRe-RankingRetrieval

Similar Papers 제목 키워드 기반

Topic-DPR: Topic-based Prompts for Dense Passage Retrieval

2023-10-10 · Qingfa Xiao, Shuangyin Li, Lei Chen

Prompt-based learning's efficacy across numerous natural language processing tasks has led to its integration into dense passage retrieval. Prior research has mainly focused on enhancing the semantic understanding of pre…

Contrastive LearningPassage RetrievalRetrieval

Dense Hierarchical Retrieval for Open-Domain Question Answering

2021-10-28 · Findings (EMNLP) 2021 11 · Ye Liu, Kazuma Hashimoto, Yingbo Zhou, Semih Yavuz 외

Dense neural text retrieval has achieved promising results on open-domain Question Answering (QA), where latent representations of questions and passages are exploited for maximum inner product search in the retrieval pr…

Open-Domain Question AnsweringQuestion AnsweringRetrievalText Retrieval

Pseudo-Relevance Feedback for Multiple Representation Dense Retrieval

2021-06-21 · Xiao Wang, Craig Macdonald, Nicola Tonellotto, Iadh Ounis

Pseudo-relevance feedback mechanisms, from Rocchio to the relevance models, have shown the usefulness of expanding and reweighting the users' initial queries using information occurring in an initial set of retrieved doc…

Information RetrievalPassage RankingRerankingRetrieval+1

Dense Passage Retrieval for Open-Domain Question Answering

2020-04-10 · EMNLP 2020 11 · Vladimir Karpukhin, Barlas Oğuz, Sewon Min, Patrick Lewis 외

Open-domain question answering relies on efficient passage retrieval to select candidate contexts, where traditional sparse vector space models, such as TF-IDF or BM25, are the de facto method. In this work, we show that…

Open-Domain Question AnsweringPassage RetrievalQuestion AnsweringRetrieval

GNN-encoder: Learning a Dual-encoder Architecture via Graph Neural Networks for Dense Passage Retrieval

2022-04-18 · Jiduan Liu, Jiahao Liu, Yang Yang, Jingang Wang 외

Recently, retrieval models based on dense representations are dominant in passage retrieval tasks, due to their outstanding ability in terms of capturing semantics of input text compared to the traditional sparse vector …

Natural QuestionsPassage RetrievalRetrievalTriviaQA