任何恒定维度的样本最佳傅里叶采样--部分I
Sample-Optimal Fourier Sampling in Any Constant Dimension -- Part I
摘要:
我们给出了一个算法$\ell_2/\ell_2$稀疏恢复傅立叶测量使用$O(k\log N)$样本,匹配的下限\cite{DIPW}的非自适应算法的常数因子的任何$k\leq N^{1-δ}$。该算法在$\tilde O(N)$时间内运行。我们的算法扩展到更高的维度,导致$O_d(k\log N)$,这是最佳的常数因子的任何$d=O(1)$的样本复杂性。这些是第一个样本优化算法,这些问题。初步的实验评估表明,我们的算法具有经验采样的复杂性,在文献中已知的其他恢复方法,同时提供强有力的可证明的保证恢复质量。
英文摘要:
We give an algorithm for $\ell_2/\ell_2$ sparse recovery from Fourier measurements using $O(k\log N)$ samples, matching the lower bound of \cite{DIPW} for non-adaptive algorithms up to constant factors for any $k\leq N^{1-δ}$. The algorithm runs in $\tilde O(N)$ time. Our algorithm extends to higher dimensions, leading to sample complexity of $O_d(k\log N)$, which is optimal up to constant factors for any $d=O(1)$. These are the first sample optimal algorithms for these problems. A preliminary experimental evaluation indicates that our algorithm has empirical sampling complexity comparable to that of other recovery methods known in the literature, while providing strong provable guarantees on the recovery quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。