paper-with-me

Papers

Efficient Neural Ranking using Forward Indexes and Lightweight Encoders

2023-11-02 · Jurek Leonhardt, Henrik Müller, Koustav Rudra, Megha Khosla, Abhijit Anand, Avishek Anand

Dual-encoder-based dense retrieval models have become the standard in IR. They employ large Transformer-based language models, which are notoriously inefficient in terms of resources and latency. We propose Fast-Forward indexes -- vector forward indexes which exploit the semantic matching capabilities of dual-encoder models for efficient and effective re-ranking. Our framework enables re-ranking at very high retrieval depths and combines the merits of both lexical and semantic matching via score interpolation. Furthermore, in order to mitigate the limitations of dual-encoders, we tackle two main challenges: Firstly, we improve computational efficiency by either pre-computing representations, avoiding unnecessary computations altogether, or reducing the complexity of encoders. This allows us to considerably improve ranking efficiency and latency. Secondly, we optimize the memory footprint and maintenance cost of indexes; we propose two complementary techniques to reduce the index size and show that, by dynamically dropping irrelevant document tokens, the index maintenance efficiency can be improved substantially. We perform evaluation to show the effectiveness and efficiency of Fast-Forward indexes -- our method has low latency and achieves competitive results without the need for hardware acceleration, such as GPUs.

📄 PDF Abstract BibTeX arXiv:2311.01263

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyRe-RankingRetrieval

Similar Papers 제목 키워드 기반

Efficient Neural Ranking using Forward Indexes

2021-10-12 · Jurek Leonhardt, Koustav Rudra, Megha Khosla, Abhijit Anand 외

Neural document ranking approaches, specifically transformer models, have achieved impressive gains in ranking performance. However, query processing using such over-parameterized models is both resource and time intensi…

CPUDocument RankingRetrievalSemantic Similarity+1

Relevance ranking for proximity full-text search based on additional indexes with multi-component keys

2021-08-01 · Alexander B. Veretennikov

The problem of proximity full-text search is considered. If a search query contains high-frequently occurring words, then multi-component key indexes deliver an improvement in the search speed compared with ordinary inve…

Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever

2025-01-15 · Xingyan Bin, Jianfei Cui, Wujie Yan, Zhichen Zhao 외

Retrievers, which form one of the most important recommendation stages, are responsible for efficiently selecting possible positive samples to the later stages under strict latency limitations. Because of this, large-sca…

Quantization

Knowledge Distillation for High Dimensional Search Index

2023-09-21 · NeurIPS 2023 11

Lightweight compressed models are prevalent in Approximate Nearest Neighbor Search (ANNS) and Maximum Inner Product Search (MIPS) owing to their superiority of retrieval efficiency in large-scale datasets. However, resul…

LIST: Learning to Index Spatio-Textual Data for Embedding based Spatial Keyword Queries

2024-03-12 · Ziqi Yin, Shanshan Feng, Shang Liu, Gao Cong 외

With the proliferation of spatio-textual data, Top-k KNN spatial keyword queries (TkQs), which return a list of objects based on a ranking function that considers both spatial and textual relevance, have found many real-…

Pseudo LabelReranking