VIBE: Vector Index Benchmark for Embeddings
Not on the map. Why?
Abstract (arXiv)
Approximate nearest neighbor (ANN) search is a performance-critical component of many machine learning pipelines, and rigorous benchmarking is essential for assessing the performance of vector indexes for ANN search. However, the datasets of existing benchmarks no longer represent modern ANN applications, creating a need for an up-to-date benchmark. To address this gap, we introduce Vector Index Benchmark for Embeddings (VIBE), an open-source framework for benchmarking ANN algorithms. VIBE provides a pipeline for generating benchmark datasets with dense embedding models representative of modern applications, including retrieval-augmented generation (RAG). To represent real-world workloads, we also include out-of-distribution (OOD) datasets where the queries and the corpus are drawn from different distributions. These include multimodal retrieval datasets and maximum inner product search (MIPS) datasets covering two recent use cases: approximate attention computation and reductions of multi-vector retrieval to single-vector MIPS. We use VIBE to conduct a comprehensive evaluation of 22 open-source vector-index implementations across 11 in-distribution and 8 out-of-distribution datasets. The benchmark is available at https://github.com/vector-index-bench/vibe
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 74 of its 123 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
74 of 123 references.
References · 74
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
38 more
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2021Improving language models by retrieving from trillions of tokenscited by 1,278
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 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
- 2019CodeSearchNet Challenge: Evaluating the State of Semantic Code Searchcited by 638
- 2022MTEB: Massive Text Embedding Benchmarkcited by 623
- 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
- 2024The Faiss librarycited by 370
- 2022One Embedder, Any Task: Instruction-Finetuned Text Embeddingscited by 329
- 2020Google Landmarks Dataset v2 -- A Large-Scale Benchmark for Instance-Level Recognition and Retrievalcited by 305
- 2024Nomic Embed: Training a Reproducible Long Context Text Embeddercited by 255
- 2019Generalized Sliced Wasserstein Distancescited by 205
- 2021PAQ: 65 Million Probably-Asked Questions and What You Can Do With Themcited by 198
- 2021Benchmarking Representation Learning for Natural World Image Collectionscited by 167
- 2022Data Determines Distributional Robustness in Contrastive Language Image Pre-training (CLIP)cited by 137
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
- 2023Unlimiformer: Long-Range Transformers with Unlimited Length Inputcited by 127
- 2024RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrievalcited by 114
- 2024MagicPIG: LSH Sampling for Efficient LLM Generationcited by 112
- 2022Retrieval Augmented Classification for Long-Tail Visual Recognitioncited by 106
- 2017Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graphcited by 103
- 2023Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documentscited by 103
- 2023AnglE-optimized Text Embeddingscited by 98
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
- 2021A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Searchcited by 82
- 2019Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Indexcited by 64
- 2023KDEformer: Accelerating Transformers via Kernel Density Estimationcited by 58
- 2021GooAQ: Open Question Answering with Diverse Answer Typescited by 53
- 2023InstructRetro: Instruction Tuning post Retrieval-Augmented Pretrainingcited by 53
- 2024RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Searchcited by 46
- 2022Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Searchcited by 45
50 most cited of 74 All 74 (JSON)
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026A Super Fast K-means for Indexing Vector Embeddingscited by 2
- 2026LEMUR: Learned Multi-Vector Retrievalcited by 1
- 2026Semantic Recall for Vector Searchcited by 0
- 2026ANN Search: Recall What Matterscited by 0
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddingscited by 0
- 2026A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Searchcited by 0
- 2026A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search2 Sep 2026
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings30 Jul 2026
- 2026ANN Search: Recall What Matters3 Jun 2026
- 2026Semantic Recall for Vector Search22 Apr 2026
- 2026A Super Fast K-means for Indexing Vector Embeddings20 Mar 2026
- 2026LEMUR: Learned Multi-Vector Retrieval29 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2025LEANN: A Low-Storage Vector Index
- 2026A Comprehensive Empirical Evaluation of Vector Database Systems for Approximate Nearest Neighbor Search: Performance, Quality, and Resource Trade-offs
- 2024NUDGE: Lightweight Non-Parametric Fine-Tuning of Embeddings for Retrieval
- 2025Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
- 2024Beyond Benchmarks: Evaluating Embedding Model Similarity for Retrieval Augmented Generation Systems
- 2024Vector Retrieval with Similarity and Diversity: How Hard Is It?
- 2025HAKES: Scalable Vector Database for Embedding Search Service
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysis