近最优(欧几里德)度量压缩
Near-Optimal (Euclidean) Metric Compression
摘要:
公制草图绘制问题定义如下。给定$n$点和$ε>0$的度量,我们希望产生一个小尺寸的数据结构(草图),给定任何一对点索引,恢复点之间的距离直到$1+ε$失真。在本文中,我们考虑由$\ell_2$和$\ell_1$范数诱导的度量,其扩展(直径与最近对距离的比率)由$Φ>0$限定。由Johnson和Lindenstrauss提出的一个众所周知的降维定理产生了尺寸为$O(ε^{-2} \log (Φn) n\log n)$的草图,即,每点$O(ε^{-2} \log (Φn) \log n)$位。我们表明,这个界限是不是最佳的,可以大大提高到$O(ε^{-2}\log(1/ε) \cdot \log n + \log\log Φ)$位每点。此外,我们表明,我们的界是紧的$\log(1/ε)$的一个因素。我们还考虑了一般指标的草图,并提供了一个草图的大小$O(n\log(1/ε)+ \log\log Φ)$位每点,我们表明是最佳的。
英文摘要:
The metric sketching problem is defined as follows. Given a metric on $n$ points, and $ε>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up to a $1+ε$ distortion. In this paper we consider metrics induced by $\ell_2$ and $\ell_1$ norms whose spread (the ratio of the diameter to the closest pair distance) is bounded by $Φ>0$. A well-known dimensionality reduction theorem due to Johnson and Lindenstrauss yields a sketch of size $O(ε^{-2} \log (Φn) n\log n)$, i.e., $O(ε^{-2} \log (Φn) \log n)$ bits per point. We show that this bound is not optimal, and can be substantially improved to $O(ε^{-2}\log(1/ε) \cdot \log n + \log\log Φ)$ bits per point. Furthermore, we show that our bound is tight up to a factor of $\log(1/ε)$. We also consider sketching of general metrics and provide a sketch of size $O(n\log(1/ε)+ \log\log Φ)$ bits per point, which we show is optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。