all AI news
SOAR: Improved Indexing for Approximate Nearest Neighbor Search
April 2, 2024, 7:42 p.m. | Philip Sun, David Simcha, Dave Dopson, Ruiqi Guo, Sanjiv Kumar
cs.LG updates on arXiv.org arxiv.org
Abstract: This paper introduces SOAR: Spilling with Orthogonality-Amplified Residuals, a novel data indexing technique for approximate nearest neighbor (ANN) search. SOAR extends upon previous approaches to ANN search, such as spill trees, that utilize multiple redundant representations while partitioning the data to reduce the probability of missing a nearest neighbor during search. Rather than training and computing these redundant representations independently, however, SOAR uses an orthogonality-amplified residual loss, which optimizes each representation to compensate for cases …
abstract ann approximate nearest neighbor arxiv cs.lg data indexing multiple novel paper partitioning probability reduce search soar trees type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Codec Avatars Research Engineer
@ Meta | Pittsburgh, PA