稀疏向量的l_1模线性降维
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors
摘要:
本文提出了一种新的恢复m-稀疏信号的方法,同时是均匀和快速的。我们提出了一个重建算法,其运行时间为O(m log^2(m)log^2(d)),是次线性的信号的长度d。重构误差在l_1中的最佳m项近似误差的对数因子(以m为单位)内。特别是,该算法恢复m-稀疏信号完美,噪声信号恢复与多对数失真。我们的算法进行O(m log^2(d))测量,这是在最佳的对数因子内。我们还提出了一个小空间实现的算法。这些草图绘制技术和相应的重建算法提供了l_1范数的算法降维。特别地,在维度d中支持m的向量可以线性地嵌入到O(m log^2 d)维中,具有多对数失真。我们可以在时间O(m log^2(m)log^2(d))内从向量的低维草图重建向量。此外,这种重建是稳定的和强大的小扰动下。
英文摘要:
This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal. The reconstruction error is within a logarithmic factor (in m) of the optimal m-term approximation error in l_1. In particular, the algorithm recovers m-sparse signals perfectly and noisy signals are recovered with polylogarithmic distortion. Our algorithm makes O(m log^2 (d)) measurements, which is within a logarithmic factor of optimal. We also present a small-space implementation of the algorithm. These sketching techniques and the corresponding reconstruction algorithms provide an algorithmic dimension reduction in the l_1 norm. In particular, vectors of support m in dimension d can be linearly embedded into O(m log^2 d) dimensions with polylogarithmic distortion. We can reconstruct a vector from its low-dimensional sketch in time O(m log^2(m) log^2(d)). Furthermore, this reconstruction is stable and robust under small perturbations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。