%0 Journal Article %1 10.1145/3631939 %A Leonhardt, Jurek %A Müller, Henrik %A Rudra, Koustav %A Khosla, Megha %A Anand, Abhijit %A Anand, Avishek %C New York, NY, USA %D 2024 %I Association for Computing Machinery %J ACM Trans. Inf. Syst. %K #rank1 IR efficiency myown ranking %R 10.1145/3631939 %T Efficient Neural Ranking using Forward Indexes and Lightweight Encoders %U https://doi.org/10.1145/3631939 %X 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.

@article{10.1145/3631939, abstract = {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.}, added-at = {2024-02-07T12:11:27.000+0100}, address = {New York, NY, USA}, author = {Leonhardt, Jurek and M\"{u}ller, Henrik and Rudra, Koustav and Khosla, Megha and Anand, Abhijit and Anand, Avishek}, biburl = {https://www.bibsonomy.org/bibtex/2f8c0e2ea6597727a39f6ff9d78d4329c/leonhardt}, doi = {10.1145/3631939}, interhash = {f15387cc674dc429035ce55033a071d2}, intrahash = {f8c0e2ea6597727a39f6ff9d78d4329c}, issn = {1046-8188}, journal = {ACM Trans. Inf. Syst.}, keywords = {#rank1 IR efficiency myown ranking}, note = {Just Accepted}, publisher = {Association for Computing Machinery}, timestamp = {2024-02-07T12:11:27.000+0100}, title = {Efficient Neural Ranking using Forward Indexes and Lightweight Encoders}, url = {https://doi.org/10.1145/3631939}, year = 2024 }