Faster Learned Sparse Retrieval With Guided Traversal

Abstract

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 approaches are very expensive to run, making them difficult to deploy under strict latency constraints. To address this limitation, recent studies have proposed new families of learned sparse models that try to match the effectiveness of learned dense models, while leveraging the traditional inverted index data structure for efficiency. Current learned sparse models learn the weights of terms in documents and, sometimes, queries; however, they exploit different vocabulary structures, document expansion techniques, and query expansion strategies, which can make them slower than traditional sparse models such as BM25. In this work, we propose a novel indexing and query processing technique that exploits a traditional sparse model's "guidance" to efficiently traverse the index

Stats

• citations31
• S2 citations—
• github stars0
• HF likes0
• heat score11.29
• arxiv keymallia2022faster

Related papers

• Optimizing Guided Traversal For Fast Learned Sparse Retrieval (2023)9.03
• Efficient Inverted Indexes For Approximate Retrieval Over Learned Sparse Representations (2024)11.67
• Predicting Efficiency/effectiveness Trade-offs For Dense Vs. Sparse Retrieval Strategy Selection (2021)11.29
• Deeperimpact: Optimizing Sparse Learned Index Structures (2024)0.00
• End-to-end Retrieval With Learned Dense And Sparse Representations Using Lucene (2023)0.00
• Early Stage Sparse Retrieval With Entity Linking (2022)6.77
• Towards Competitive Search Relevance For Inference-free Learned Sparse Retrievers (2024)0.00
• Improving Neural Ranking Models With Traditional IR Methods (2023)0.00