arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.03178cs.DS
收藏

循环二进制嵌入的近似最优样本复杂度界

Near-Optimal Sample Complexity Bounds for Circulant Binary Embedding

Samet Oymak

摘要:

二进制嵌入是将点从高维空间映射到低维的汉明立方体,同时保持两两距离的问题。实现这一点的有效方法是利用涉及傅立叶变换的快速嵌入技术,例如~循环矩阵虽然二进制嵌入已经被广泛研究,但关于快速二进制嵌入的理论结果相当有限。在这项工作中,我们建立在最近的文献,以获得更好的依赖性的问题参数。$\mathbb{R}^n$中的一组$N$点可以通过使用$k\simδ^{-3}\log N$样本适当地嵌入到具有$δ$失真的汉明立方体$\{\pm 1\}^k$中,该样本在点$N$的数量上是最优的并且与最优失真依赖性$δ^{-2}$比较好。我们的最佳嵌入结果适用于政权$\log N\lesssim n^{1/3}$。此外,如果宽松的条件$\log N\lesssim \sqrt{n}$举行,我们表明,所有,但任意小部分的点可以最佳嵌入。我们相信,我们的技术可以是有用的,以获得改善其他非线性嵌入问题的保证。

英文摘要:

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques involving Fourier transform e.g.~circulant matrices. While binary embedding has been studied extensively, theoretical results on fast binary embedding are rather limited. In this work, we build upon the recent literature to obtain significantly better dependencies on the problem parameters. A set of $N$ points in $\mathbb{R}^n$ can be properly embedded into the Hamming cube $\{\pm 1\}^k$ with $δ$ distortion, by using $k\simδ^{-3}\log N$ samples which is optimal in the number of points $N$ and compares well with the optimal distortion dependency $δ^{-2}$. Our optimal embedding result applies in the regime $\log N\lesssim n^{1/3}$. Furthermore, if the looser condition $\log N\lesssim \sqrt{n}$ holds, we show that all but an arbitrarily small fraction of the points can be optimally embedded. We believe our techniques can be useful to obtain improved guarantees for other nonlinear embedding problems.

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

↑