arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.02701cs.DScs.CCcs.CGcs.ITmath.IT
收藏

近似近邻的时空折衷下界

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors

Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten

摘要:

我们展示了紧密的下界空间和查询时间之间的整个权衡的近似近邻搜索问题。我们的下限在一个受限的计算模型中成立,该模型捕获了所有基于散列的方法。特别地,我们的下界与最近在[Laarhoven 2015]中针对欧几里得球面上的随机实例所示的上界相匹配(我们使用[Andoni,Razenshteyn 2015]中的技术实际上扩展到整个空间$\mathbb{R}^d$)。我们还显示了一个和两个探针的紧密的,无条件的细胞探针下限,改进了[Panigrahy,Talwar,Wieder 2010]的最佳已知界限。特别地,这是两个探测器的第一空间下界(对于任何静态数据结构),其不是多项式地小于一个探测器的空间下界。为了显示两个探测器的结果,我们建立并利用与本地可解码代码的连接。

英文摘要:

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In articular, our lower bound matches the upper bound recently shown in [Laarhoven 2015] for the random instance on a Euclidean sphere (which we show in fact extends to the entire space $\mathbb{R}^d$ using the techniques from [Andoni, Razenshteyn 2015]). We also show tight, unconditional cell-probe lower bounds for one and two probes, improving upon the best known bounds from [Panigrahy, Talwar, Wieder 2010]. In particular, this is the first space lower bound (for any static data structure) for two probes which is not polynomially smaller than for one probe. To show the result for two probes, we establish and exploit a connection to locally-decodable codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑