arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.5513cs.DS
收藏

几乎最优无约束快速Johnson-Lindenstrauss变换

Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform

Nir Ailon, Edo Liberty

摘要:

随机投影问题和稀疏重建问题既有许多共同点,又有各自的特点。令人惊讶的是,到目前为止,它们一直在平行发展,而且大多数情况下保持独立。在这里,我们采用新的工具,从概率在Banach空间中,成功地用于稀疏重建的背景下,推进一个开放的问题,在随机投影。特别是,我们推广和使用一个复杂的结果,由Rudelson和Vershynin稀疏重建使用达德利定理的边界高斯过程。我们的主要结果表明,任何一组$N = \exp(\tilde{O}(n))$实向量在$n$维空间可以线性映射到一个空间的维数$k=O(\log N\polylog(n))$,而(1)保持成对的距离之间的任何常数失真和(2)能够应用变换的时间$O(n\log n)$对每个向量。这改进了由Ailon和Liberty实现的最著名的$N = \exp(\tilde{O}(n^{1/2}))$以及由Ailon和Chazelle实现的$N = \exp(\tilde{O}(n^{1/3}))$。然而,在失真常数的依赖性被认为是次优的,并受到进一步的调查。对于恒定失真,这解决了这些作者提出的开放问题,直到$\polylog(n)$因子,同时大大简化了它们的构造。

英文摘要:

The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from probability in Banach spaces that were successfully used in the context of sparse reconstruction to advance on an open problem in random pojection. In particular, we generalize and use an intricate result by Rudelson and Vershynin for sparse reconstruction which uses Dudley's theorem for bounding Gaussian processes. Our main result states that any set of $N = \exp(\tilde{O}(n))$ real vectors in $n$ dimensional space can be linearly mapped to a space of dimension $k=O(\log N\polylog(n))$, while (1) preserving the pairwise distances among the vectors to within any constant distortion and (2) being able to apply the transformation in time $O(n\log n)$ on each vector. This improves on the best known $N = \exp(\tilde{O}(n^{1/2}))$ achieved by Ailon and Liberty and $N = \exp(\tilde{O}(n^{1/3}))$ by Ailon and Chazelle. The dependence in the distortion constant however is believed to be suboptimal and subject to further investigation. For constant distortion, this settles the open question posed by these authors up to a $\polylog(n)$ factor while considerably simplifying their constructions.

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

↑