paper-with-me

Papers

End-to-End Retrieval with Learned Dense and Sparse Representations Using Lucene

2023-11-30 · Haonan Chen, Carlos Lassance, Jimmy Lin

The bi-encoder architecture provides a framework for understanding machine-learned retrieval models based on dense and sparse vector representations. Although these representations capture parametric realizations of the same underlying conceptual framework, their respective implementations of top-$k$ similarity search require the coordination of different software components (e.g., inverted indexes, HNSW indexes, and toolkits for neural inference), often knitted together in complex architectures. In this work, we ask the following question: What's the simplest design, in terms of requiring the fewest changes to existing infrastructure, that can support end-to-end retrieval with modern dense and sparse representations? The answer appears to be that Lucene is sufficient, as we demonstrate in Anserini, a toolkit for reproducible information retrieval research. That is, effective retrieval with modern single-vector neural models can be efficiently performed directly in Java on the CPU. We examine the implications of this design for information retrieval researchers pushing the state of the art as well as for software engineers building production search systems.

📄 PDF Abstract BibTeX arXiv:2311.18503

Code (0)

등록된 구현이 없습니다.

Tasks

CPUInformation RetrievalRetrieval

Similar Papers 제목 키워드 기반

Anserini Gets Dense Retrieval: Integration of Lucene's HNSW Indexes

2023-04-24 · Xueguang Ma, Tommaso Teofili, Jimmy Lin

Anserini is a Lucene-based toolkit for reproducible information retrieval research in Java that has been gaining traction in the community. It provides retrieval capabilities for both "traditional" bag-of-words retrieval…

Information RetrievalRetrieval

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

Flexible retrieval with NMSLIB and FlexNeuART

2020-10-28 · EMNLP (NLPOSS) 2020 11 · Leonid Boytsov, Eric Nyberg

Our objective is to introduce to the NLP community an existing k-NN search library NMSLIB, a new retrieval toolkit FlexNeuART, as well as their integration capabilities. NMSLIB, while being one the fastest k-NN search li…

Re-RankingRetrieval

A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniques

2021-06-28 · Jimmy Lin, Xueguang Ma

Recent developments in representational learning for information retrieval can be organized in a conceptual framework that establishes two pairs of contrasts: sparse vs. dense representations and unsupervised vs. learned…

Information RetrievalPassage RankingRetrieval

Densifying Sparse Representations for Passage Retrieval by Representational Slicing

2021-12-09 · Sheng-Chieh Lin, Jimmy Lin

Learned sparse and dense representations capture different successful approaches to text retrieval and the fusion of their results has proven to be more effective and robust. Prior work combines dense and sparse retrieve…

Passage RetrievalRetrievalText Retrieval