Fetching the paper…
Reading the bibliography…
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.
Learning deep structured semantic models for web search using clickthrough data
Po-Sen Huang, Xiaodong He, Jianfeng Gao, Li Deng, Alex Acero, and Larry Heck · 2013
Earlier work this paper cites.
Yury A. Malkov and D. A. Yashunin · 2016
Earlier work this paper cites.
MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng · 2016
Earlier work this paper cites.
YFCC100M: The new data in multimedia research
Bart Thomee, David A Shamma, Gerald Friedland, Benjamin Elizalde, Karl Ni, Douglas Poland, Damian Borth, and Li-Jia Li · 2016
Earlier work this paper cites.
Squeeze-and-excitation networks
Jie Hu, Li Shen, and Gang Sun · 2018
Earlier work this paper cites.
PISA: Performant indexes and search for academia
Antonio Mallia, Michal Siedlaczek, Joel Mackenzie, and Torsten Suel · 2019
Earlier work this paper cites.
Diskann: Fast accurate billion-point nearest neighbor search on a single node
Suhas Jayaram Subramanya, Fnu Devvrit, Rohan Kadekodi, Ravishankar Krishnawamy, and Harsha Vardhan Simhadri · 2019
Earlier work this paper cites.
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull · 2020
Earlier work this paper cites.
Generalization through memorization: Nearest neighbor language models
Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis · 2020
Cited alongside, same era.
https://github.com/facebookresearch/faiss/wiki/Indexing-1G-vectors
Indexing 1G vectors with Faiss · 2021
Cited alongside, same era.
Learning transferable visual models from natural language supervision, 2021
Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever · 2021
Cited alongside, same era.
Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, and Jingdong Wang · 2021
Cited alongside, same era.
Freshdiskann: A fast and accurate graph-based ANN index for streaming similarity search
Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri · 2021
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors, 2023
Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty · 2023
Later among the works it cites.
"Pinecone algorithms set new records for BigANN"
A. Ingber et al · 2023
Later among the works it cites.
DiskANN: Graph-structured Indices for Scalable, Fast, Fresh and Filtered Approximate Nearest Neighbor Search
Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Andrija Antonijevic, Dax Pryce, David Kaczynski, Shane Williams, Siddarth Gollapudi, Varun Sivashankar, Neel Karia, Aditi Singh, Shikhar Jaiswal, Neelam Mahapatro, Philip Adams, Bryan Tower, and Yash Patel · 2023
Later among the works it cites.
Efficient inverted indexes for approximate retrieval over learned sparse representations
Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, and Rossano Venturini · 2024
Closest in time.
Efficient inverted indexes for approximate retrieval over learned sparse representations
Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, and Rossano Venturini · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective
Thibault Formal, Carlos Lassance, Benjamin Piwowarski, and Stéphane Clinchant · 2022
Cited alongside, same era.
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries, 2022
Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg, Harsha Vardhan Simhadri, and Sheshansh Agrawal · 2022
Cited alongside, same era.
https://github.com/pinecone-io/research-bigann-linscan , 2023
Code for the linscan baseline algorithm · 2023
Cited alongside, same era.
Closest in time.
RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search, June 2024
Meng Chen · 2024
Closest in time.
Roargraph: A projected bipartite graph for efficient cross-modal approximate nearest neighbor search
Meng Chen, Kai Zhang, Zhenying He, Yinan Jing, and X. Sean Wang · 2024
Closest in time.
Matthijs Douze, Alexandr Guzhva, Chengqi Deng, Jeff Johnson, Gergely Szilvasy, Pierre-Emmanuel Mazaré, Maria Lomeli, Lucas Hosseini, and Hervé Jégou · 2024
Closest in time.