Automating Nearest Neighbor Search Configuration with Constrained Optimization

01/04/2023
by   Philip Sun, et al.
6

The approximate nearest neighbor (ANN) search problem is fundamental to efficiently serving many real-world machine learning applications. A number of techniques have been developed for ANN search that are efficient, accurate, and scalable. However, such techniques typically have a number of parameters that affect the speed-recall tradeoff, and exhibit poor performance when such parameters aren't properly set. Tuning these parameters has traditionally been a manual process, demanding in-depth knowledge of the underlying search algorithm. This is becoming an increasingly unrealistic demand as ANN search grows in popularity. To tackle this obstacle to ANN adoption, this work proposes a constrained optimization-based approach to tuning quantization-based ANN algorithms. Our technique takes just a desired search cost or recall as input, and then generates tunings that, empirically, are very close to the speed-recall Pareto frontier and give leading performance on standard benchmarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2018

ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

This paper describes ANN-Benchmarks, a tool for evaluating the performan...
research
06/28/2022

TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s

This paper presents a novel nearest neighbor search algorithm achieving ...
research
07/06/2021

DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search

Kernel Density Estimation (KDE) is a nonparametric method for estimating...
research
01/26/2017

Sparse Ternary Codes for similarity search have higher coding gain than dense binary codes

This paper addresses the problem of Approximate Nearest Neighbor (ANN) s...
research
05/08/2022

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

Despite the broad range of algorithms for Approximate Nearest Neighbor S...
research
04/30/2018

Algorithms for Deciding Membership in Polytopes of General Dimension

We study the fundamental problem of polytope membership aiming at large ...
research
08/31/2015

Approximate Nearest Neighbor Fields in Video

We introduce RIANN (Ring Intersection Approximate Nearest Neighbor searc...

Please sign up or login with your details

Forgot password? Click here to reset