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

四次样点法用于Fourier插值

Quartic Samples Suffice for Fourier Interpolation

Zhao Song, Baocheng Sun, Omri Weinstein, Ruizhe Zhang

摘要:

我们研究了从相同范围内的噪声样本在持续时间$[0, T]$内插值噪声傅里叶稀疏信号的问题,其中地面真实信号可以是具有带限$[-F, F]$的任何$k$ -傅里叶稀疏信号。我们的主要结果是一个高效的傅立叶插值算法,它在以下三个方面改进了[Chen,Kane,Price和Song,FOCS 2016]以前的最佳算法:$\bullet$样本复杂度从$\widetilde{O}(k^{51})$提高到$\widetilde{O}(k^{4})$。时间复杂度从$\bullet$提高到$\widetilde{O}(k^{4 ω})$。$\bullet$输出稀疏度从$\widetilde{O}(k^{10})$提高到$\widetilde{O}(k^{4})$。这里,$ω$表示快速矩阵乘法的指数。这个问题的最先进的样本复杂度是$\sim k^4$,但已知只能通过 * 指数时间 * 算法来实现。我们的算法使用相同数量的样本,但具有多项式运行时间,为高效的傅立叶插值算法奠定了基础。我们的算法的核心是一个新的频率估计任务的充分条件-高信噪比(SNR)频带条件-这允许有效和准确的信号重建。基于这一条件以及一种新的傅立叶信号的结构分解(信号等效方法),我们设计了一种廉价的算法来估计每个“重要”的频率在一个狭窄的范围内,然后将其与信号估计算法结合到一个新的傅立叶插值框架来重建地面真实信号。

英文摘要:

We study the problem of interpolating a noisy Fourier-sparse signal in the time duration $[0, T]$ from noisy samples in the same range, where the ground truth signal can be any $k$-Fourier-sparse signal with band-limit $[-F, F]$. Our main result is an efficient Fourier Interpolation algorithm that improves the previous best algorithm by [Chen, Kane, Price, and Song, FOCS 2016] in the following three aspects: $\bullet$ The sample complexity is improved from $\widetilde{O}(k^{51})$ to $\widetilde{O}(k^{4})$. $\bullet$ The time complexity is improved from $ \widetilde{O}(k^{10ω+40})$ to $\widetilde{O}(k^{4 ω})$. $\bullet$ The output sparsity is improved from $\widetilde{O}(k^{10})$ to $\widetilde{O}(k^{4})$. Here, $ω$ denotes the exponent of fast matrix multiplication. The state-of-the-art sample complexity of this problem is $\sim k^4$, but was only known to be achieved by an *exponential-time* algorithm. Our algorithm uses the same number of samples but has a polynomial runtime, laying the groundwork for an efficient Fourier Interpolation algorithm. The centerpiece of our algorithm is a new sufficient condition for the frequency estimation task -- a high signal-to-noise (SNR) band condition -- which allows for efficient and accurate signal reconstruction. Based on this condition together with a new structural decomposition of Fourier signals (Signal Equivalent Method), we design a cheap algorithm for estimating each "significant" frequency within a narrow range, which is then combined with a signal estimation algorithm into a new Fourier Interpolation framework to reconstruct the ground-truth signal.

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

↑