Optimal Las Vegas Approximate Near Neighbors in p

Author:

Wei Alexander1

Affiliation:

1. UC Berkeley, Soda Hall, Berkeley, CA

Abstract

We show that approximate near neighbor search in high dimensions can be solved in a Las Vegas fashion (i.e., without false negatives) for ℓ p (1≤ p ≤ 2) while matching the performance of optimal locality-sensitive hashing. Specifically, we construct a data-independent Las Vegas data structure with query time O ( dn ρ ) and space usage O ( dn 1+ρ ) for ( r, c r )-approximate near neighbors in R d under the ℓ p norm, where ρ = 1/ c p + o (1). Furthermore, we give a Las Vegas locality-sensitive filter construction for the unit sphere that can be used with the data-dependent data structure of Andoni et al. (SODA 2017) to achieve optimal space-time tradeoffs in the data-dependent setting. For the symmetric case, this gives us a data-dependent Las Vegas data structure with query time O ( dn ρ ) and space usage O ( dn 1+ρ ) for ( r, c r )-approximate near neighbors in R d under the ℓ p norm, where ρ = 1/(2 c p - 1) + o (1). Our data-independent construction improves on the recent Las Vegas data structure of Ahle (FOCS 2017) for ℓ p when 1 < p ≤ 2. Our data-dependent construction performs even better for ℓ p for all pε [1, 2] and is the first Las Vegas approximate near neighbors data structure to make use of data-dependent approaches. We also answer open questions of Indyk (SODA 2000), Pagh (SODA 2016), and Ahle by showing that for approximate near neighbors, Las Vegas data structures can match state-of-the-art Monte Carlo data structures in performance for both the data-independent and data-dependent settings and across space-time tradeoffs.

Funder

Harvard PRISE Fellowship and a Herchel Smith Fellowship

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3