最优(欧几里德)度量压缩
Optimal (Euclidean) Metric Compression
摘要:
我们研究的问题,代表所有的$n$点之间的距离在$\mathbb R^d$,任意小的失真,使用尽可能少的位。对于欧几里得度量、对于$\ell_1$(又名~),我们给出了该问题的渐进紧界Manhattan)度量,以及用于一般度量。我们的欧几里德度量的界限标志着对基于离散化Johnson和Lindenstrauss(Contemp.~)的经典降维定理的压缩方案的第一次改进。数学~ 1984年)。由于它是已知的,没有更好的降维是可能的,我们的研究结果建立,欧几里德度量压缩是可能超越降维。
英文摘要:
We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for $\ell_1$ (a.k.a.~Manhattan) metrics, and for general metrics. Our bounds for Euclidean metrics mark the first improvement over compression schemes based on discretizing the classical dimensionality reduction theorem of Johnson and Lindenstrauss (Contemp.~Math.~1984). Since it is known that no better dimension reduction is possible, our results establish that Euclidean metric compression is possible beyond dimension reduction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。