about
Results of the Big ANN: NeurIPS'23 Competition (arxiv.org)
2 points by fzliu on Sep 30, 2024 | hide | past | pdf | discuss on HN

In plain words: Teams competed to build fast lookup indexes for finding the closest matching items, tackling harder cases like filtered results, unfamiliar data, sparse vectors, and streams of new entries. The best entries searched more accurately and cheaply than the industry-standard tools used today.

Abstract · Results of the Big ANN: NeurIPS'23 competition

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 ~\cite{DBLP: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.

Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Ben Landrum, Mazin Karjikar, Laxman Dhulipala, et al.
arXiv:2409.17424 · cs.IR, cs.DS, cs.LG, cs.PF · submitted Sep 25, 2024
abstract · pdf · html · Code: https://github.com/harsha-simhadri/big-ann-benchmarks/releases/tag/v0.3.0

add comment on HN