paper-with-me

Papers

DeeperImpact: Optimizing Sparse Learned Index Structures

2024-05-27 · Soyuj Basnet, Jerry Gou, Antonio Mallia, Torsten Suel

A lot of recent work has focused on sparse learned indexes that use deep neural architectures to significantly improve retrieval quality while keeping the efficiency benefits of the inverted index. While such sparse learned structures achieve effectiveness far beyond those of traditional inverted index-based rankers, there is still a gap in effectiveness to the best dense retrievers, or even to sparse methods that leverage more expensive optimizations such as query expansion and query term weighting. We focus on narrowing this gap by revisiting and optimizing DeepImpact, a sparse retrieval approach that uses DocT5Query for document expansion followed by a BERT language model to learn impact scores for document terms. We first reinvestigate the expansion process and find that the recently proposed Doc2Query -- query filtration does not enhance retrieval quality when used with DeepImpact. Instead, substituting T5 with a fine-tuned Llama 2 model for query prediction results in a considerable improvement. Subsequently, we study training strategies that have proven effective for other models, in particular the use of hard negatives, distillation, and pre-trained CoCondenser model initialization. Our results substantially narrow the effectiveness gap with the most effective versions of SPLADE.

📄 PDF Abstract BibTeX arXiv:2405.17093

Code (1)

basnetsoyuj/improving-learned-index 공식 구현 pytorch

Tasks

Language ModelingLanguage ModellingRetrieval

Methods 이 논문이 사용한 방법론

Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Attention 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
WordPiece 설명 없음
SentencePiece 설명 없음
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Gated Linear Unit A Gated Linear Unit, or GLU computes: $$ \mathrm{GLU}(a, b) = a \otimes \sigma(b) $$ It is used in natural language processing architectures, for example the Gated CNN,…
Weight Decay 설명 없음

Similar Papers 제목 키워드 기반

WaZI: A Learned and Workload-aware Z-Index

2023-10-06 · Sachith Pai, Michael Mathioudakis, Yanhao Wang

Learned indexes fit machine learning (ML) models to the data and use them to make query operations more time and space-efficient. Recent works propose using learned spatial indexes to improve spatial query performance by…

Faster Learned Sparse Retrieval with Guided Traversal

2022-04-24 · Antonio Mallia, Joel Mackenzie, Torsten Suel, Nicola Tonellotto

Neural information retrieval architectures based on transformers such as BERT are able to significantly improve system effectiveness over traditional sparse models such as BM25. Though highly effective, these neural appr…

Information RetrievalRetrieval

Faster Learned Sparse Retrieval with Block-Max Pruning

2024-05-02 · Antonio Mallia, Torten Suel, Nicola Tonellotto

Learned sparse retrieval systems aim to combine the effectiveness of contextualized language models with the scalability of conventional data structures such as inverted indexes. Nevertheless, the indexes generated by th…

Retrieval

Optimizing Guided Traversal for Fast Learned Sparse Retrieval

2023-05-02 · Yifan Qiao, Yingrui Yang, Haixin Lin, Tao Yang

Recent studies show that BM25-driven dynamic index skipping can greatly accelerate MaxScore-based document retrieval based on the learned sparse representation derived by DeepImpact. This paper investigates the effective…

Retrieval

SOSD: A Benchmark for Learned Indexes

2019-11-29 · Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian 외

A groundswell of recent work has focused on improving data management systems with learned components. Specifically, work on learned index structures has proposed replacing traditional index structures, such as B-trees, …

BenchmarkingManagement