Approximate Nearest Neighbor Search (ANNS) plays a pivotal role in modern deep learning pipelines. Recently, many ANNS systems have been proposed to either provide broad functionality or reach high performance.
arXiv:2603. 06660v2 Announce Type: replace-cross Abstract: Approximate Nearest Neighbor Search (ANNS) is fundamental to modern AI applications.
By Kejing Lu, Zhenpeng Pan, Jianbin Qin, Yoshiharu Ishikawa, Chuan Xiao
arXiv:2601. 07048v5 Announce Type: replace-cross Abstract: Approximate nearest neighbor search (ANNS) is a core problem in machine learning and information retrieval applications.
By Hunter McCoy, Zikun Wang, Prashant Pandey
arXiv:2607. 01283v1 Announce Type: cross Abstract: Grid-based approaches to approximate nearest neighbor (ANN) search have been absent from modern scaling analyses.
By Matthew J Liu, Wei Hang Zheng, Vidhan Purohit, Siqi Xie, Chieh-En Li, Jerry Li, Noah Flynn
arXiv:2606. 04522v1 Announce Type: cross Abstract: Approximate nearest neighbor (ANN) search has become a core primitive in information retrieval and modern machine learning tasks, from classification to retrieval-augmented generation.
By Dimitris Dimitropoulos, Nikos Mamoulis
arXiv:2505. 17810v2 Announce Type: replace Abstract: 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.
By Elias J\"a\"asaari, Ville Hyv\"onen, Matteo Ceccarello, Teemu Roos, Martin Aum\"uller
arXiv:2411. 03253v2 Announce Type: replace-cross Abstract: We propose a general framework for end-to-end learning of data structures.
By Omar Salemohamed, Laurent Charlin, Shivam Garg, Vatsal Sharan, Gregory Valiant
arXiv:2608. 09214v1 Announce Type: cross Abstract: Recent Retrieval-Augmented Generation (RAG) systems increasingly combine vector retrieval with structured knowledge, such as Graph RAG and Filtered vector search.
By Geonho Lee, Jeongho Park, Donghyoung Han, Min-Soo Kim
arXiv:2608. 15438v1 Announce Type: cross Abstract: Building approximate nearest neighbor (ANN) indexes at billion scale is often dominated by expensive global clustering or graph construction, making time-to-index a first-order systems concern.
By Xingqiao Wang, Zi Wang, Xiaowei Xu
arXiv:2508. 02091v3 Announce Type: replace-cross Abstract: Approximate nearest-neighbor search (ANNS) algorithms have become increasingly critical for recent AI applications, particularly in retrieval-augmented generation (RAG) and agent-based LLM applications.
By Xiaoya Li, Albert Wang, Guoyin Wang, Chris Shum, Jiwei Li
arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.
By Yuhang Song, Naima Abrar Shami, Romaric Duvignau, Vasiliki Kalavri
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
By Dooho Lee, Jaemin Yoo