Hybrid Inverted Index Is a Robust Accelerator for Dense Retrieval
Not on the map. Why?
Abstract (arXiv)
Inverted file structure is a common technique for accelerating dense retrieval. It clusters documents based on their embeddings; during searching, it probes nearby clusters w.r.t. an input query and only evaluates documents within them by subsequent codecs, thus avoiding the expensive cost of exhaustive traversal. However, the clustering is always lossy, which results in the miss of relevant documents in the probed clusters and hence degrades retrieval quality. In contrast, lexical matching, such as overlaps of salient terms, tends to be strong feature for identifying relevant documents. In this work, we present the Hybrid Inverted Index (HI2), where the embedding clusters and salient terms work collaboratively to accelerate dense retrieval. To make best of both effectiveness and efficiency, we devise a cluster selector and a term selector, to construct compact inverted lists and efficiently searching through them. Moreover, we leverage simple unsupervised algorithms as well as end-to-end knowledge distillation to learn these two modules, with the latter further boosting the effectiveness. Based on comprehensive experiments on popular retrieval benchmarks, we verify that clusters and terms indeed complement each other, enabling HI2 to achieve lossless retrieval quality with competitive efficiency across various index settings. Our code and checkpoint are publicly available at https://github.com/namespace-Pt/Adon/tree/HI2.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 52 references that are in the map. First posted on arXiv 11 Oct 2022.
Builds on
30 of 52 references.
References · 30
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2017Neural Discrete Representation Learningcited by 4,650
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
- 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
- 2016A Survey on Learning to Hashcited by 119
18 more
- 2022RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-Encodercited by 118
- 2022SimLM: Pre-training with Representation Bottleneck for Dense Passage Retrievalcited by 90
- 2021Adversarial Retriever-Ranker for dense text retrievalcited by 82
- 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
- 2019Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrievalcited by 65
- 2022ERNIE-Search: Bridging Cross-Encoder with Dual-Encoder via Self On-the-fly Distillation for Dense Passage Retrievalcited by 41
- 2018Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighborscited by 37
- 2021A Replication Study of Dense Passage Retrievercited by 37
- 2021Jointly Optimizing Query Encoder and Product Quantization to Improve Retrieval Performancecited by 35
- 2021SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Searchcited by 35
- 2021Pre-trained Language Model based Ranking in Baidu Searchcited by 33
- 2020Leveraging Semantic and Lexical Matching to Improve the Recall of Document Retrieval Systems: A Hybrid Approachcited by 31
- 2020Complementing Lexical Retrieval with Semantic Residual Embeddingcited by 27
- 2022UnifieR: A Unified Retriever for Large-Scale Retrievalcited by 19
- 2022Distill-VQ: Learning Retrieval Oriented Vector Quantization By Distilling Knowledge from Dense Embeddingscited by 17
- 2022LED: Lexicon-Enlightened Dense Retriever for Large-Scale Retrievalcited by 15
- 2021Matching-oriented Product Quantization For Ad-hoc Retrievalcited by 5
- 2022Faster Learned Sparse Retrieval with Guided Traversalcited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.