Results of the Big ANN: NeurIPS'23 competition
Not on the map. Why?
Abstract (arXiv)
The 2023 Big ANN Challenge, held at NeurIPS 2023, focused on advancing the state-of-the-art in indexing data structures and search algorithms for practical variants of Approximate Nearest Neighbor (ANN) search that reflect the growing complexity and diversity of workloads. Unlike prior challenges that emphasized scaling up classical ANN search ~citeDBLP:conf/nips/SimhadriWADBBCH21, this competition addressed filtered search, out-of-distribution data, sparse and streaming variants of ANNS. Participants developed and submitted innovative solutions that were evaluated on new standard datasets with constrained computational resources. The results showcased significant improvements in search accuracy and efficiency over industry-standard baselines, with notable contributions from both academic and industrial teams. This paper summarizes the competition tracks, datasets, evaluation metrics, and the innovative approaches of the top-performing submissions, providing insights into the current advancements and future directions in the field of approximate nearest neighbor search.
Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 13 of its 27 references that are in the map. First posted on arXiv 25 Sep 2024.
Builds on
13 of 27 references.
References · 13
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 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
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
- 2024The Faiss librarycited by 370
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
- 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
- 2022Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Searchcited by 45
- 2021FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Searchcited by 36
- 2024Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representationscited by 23
- 2024RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Searchcited by 12
Built on by
Citing papers per year: 2025: 12; 2026: 9.
21 papers.
Sort:
By area:
- 2025Inference-time sparse attention with asymmetric indexingcited by 11
- 2025MicroNN: An On-device Disk-resident Updatable Vector Databasecited by 6
- 2025VIBE: Vector Index Benchmark for Embeddingscited by 6
- 2025Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Samplingcited by 3
- 2026Results and Retrospective Analysis of the CODS 2025 AssetOpsBench Challengecited by 2
- 2025Machine learning and high dimensional vector searchcited by 1
- 2025LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Tablecited by 1
- 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Setscited by 1
- 2025Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Searchcited by 0
- 2025MINT: Multi-Vector Search Index Tuningcited by 0
- 2025Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Searchcited by 0
- 2025Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANNcited by 0
9 more
- 2025Exqutor: Extended Query Optimizer for Vector-augmented Analytical Queriescited by 0
- 2026MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Searchcited by 0
- 2026Welfarist Formulations for Diverse Similarity Searchcited by 0
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysiscited by 0
- 2026Filtered ANN as a Phase Transition: When Selectivity-Estimation Error Causes Plan Regretcited by 0
- 2026ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Searchcited by 0
- 2026VQ-bench: A Composable Vector Quantization Frameworkcited by 0
- 2026A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Searchcited by 0
- 2026Beyond Private Training: The New Landscape of AI Privacycited by 0
- 2026Beyond Private Training: The New Landscape of AI Privacy16 Sep 2026
- 2026A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search2 Sep 2026
- 2026VQ-bench: A Composable Vector Quantization Framework31 Jul 2026
- 2026ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search20 Jul 2026
- 2026Filtered ANN as a Phase Transition: When Selectivity-Estimation Error Causes Plan Regret15 Jun 2026
- 2026Results and Retrospective Analysis of the CODS 2025 AssetOpsBench Challenge8 May 2026
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysis11 Feb 2026
- 2026Welfarist Formulations for Diverse Similarity Search9 Feb 2026
- 2026MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search5 Jan 2026
- 2025Exqutor: Extended Query Optimizer for Vector-augmented Analytical Queries10 Dec 2025
- 2025Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN10 Dec 2025
- 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets29 Sep 2025
9 more
- 2025Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Sampling1 Jul 2025
- 2025LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table5 Jun 2025
- 2025VIBE: Vector Index Benchmark for Embeddings23 May 2025
- 2025Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search21 May 2025
- 2025MINT: Multi-Vector Search Index Tuning28 Apr 2025
- 2025MicroNN: An On-device Disk-resident Updatable Vector Database8 Apr 2025
- 2025Machine learning and high dimensional vector search24 Feb 2025
- 2025Inference-time sparse attention with asymmetric indexing12 Feb 2025
- 2025Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search10 Feb 2025
- 2025MicroNN: An On-device Disk-resident Updatable Vector Databasecited by 6
- 2025Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANNcited by 0
- 2025Exqutor: Extended Query Optimizer for Vector-augmented Analytical Queriescited by 0
- 2026Welfarist Formulations for Diverse Similarity Searchcited by 0
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysiscited by 0
- 2026Beyond Private Training: The New Landscape of AI Privacycited by 0
- 2026Beyond Private Training: The New Landscape of AI Privacy16 Sep 2026
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysis11 Feb 2026
- 2026Welfarist Formulations for Diverse Similarity Search9 Feb 2026
- 2025Exqutor: Extended Query Optimizer for Vector-augmented Analytical Queries10 Dec 2025
- 2025Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN10 Dec 2025
- 2025MicroNN: An On-device Disk-resident Updatable Vector Database8 Apr 2025
- 2025Inference-time sparse attention with asymmetric indexingcited by 11
- 2025VIBE: Vector Index Benchmark for Embeddingscited by 6
- 2025Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Samplingcited by 3
- 2025Machine learning and high dimensional vector searchcited by 1
- 2025LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Tablecited by 1
- 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Setscited by 1
- 2025Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Searchcited by 0
- 2025MINT: Multi-Vector Search Index Tuningcited by 0
- 2025Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Searchcited by 0
- 2026MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Searchcited by 0
- 2026Filtered ANN as a Phase Transition: When Selectivity-Estimation Error Causes Plan Regretcited by 0
- 2026ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Searchcited by 0
12 most cited of 14 All 14 (JSON)
- 2026A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search2 Sep 2026
- 2026VQ-bench: A Composable Vector Quantization Framework31 Jul 2026
- 2026ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search20 Jul 2026
- 2026Filtered ANN as a Phase Transition: When Selectivity-Estimation Error Causes Plan Regret15 Jun 2026
- 2026MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search5 Jan 2026
- 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets29 Sep 2025
- 2025Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Sampling1 Jul 2025
- 2025LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table5 Jun 2025
- 2025VIBE: Vector Index Benchmark for Embeddings23 May 2025
- 2025Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search21 May 2025
- 2025MINT: Multi-Vector Search Index Tuning28 Apr 2025
- 2025Machine learning and high dimensional vector search24 Feb 2025
12 newest of 14 All 14 (JSON)