Exact and/or Fast Nearest Neighbors
Matthew Francis-Landau, Benjamin Van Durme

TL;DR
This paper introduces Certified Cosine, a novel method for high-dimensional nearest neighbor search that provides certificates guaranteeing correctness, often avoiding exhaustive search and outperforming previous exact methods.
Contribution
The paper presents Certified Cosine, a new approach leveraging cosine similarity structure to certify nearest neighbors, improving efficiency and accuracy in high-dimensional data retrieval.
Findings
Certificates guarantee correct nearest neighbors in high dimensions.
Certified Cosine outperforms previous exact methods.
Avoids exhaustive search in many cases.
Abstract
Prior methods for retrieval of nearest neighbors in high dimensions are fast and approximate--providing probabilistic guarantees of returning the correct answer--or slow and exact performing an exhaustive search. We present Certified Cosine, a novel approach to nearest-neighbors which takes advantage of structure present in the cosine similarity distance metric to offer certificates. When a certificate is constructed, it guarantees that the nearest neighbor set is correct, possibly avoiding an exhaustive search. Certified Cosine's certificates work with high dimensional data and outperform previous exact nearest neighbor methods on these datasets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Image and Video Retrieval Techniques · Algorithms and Data Compression · Machine Learning and Algorithms
