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

快速傅立叶稀疏性测试

Fast Fourier Sparsity Testing

Grigory Yaroslavtsev, Samson Zhou

摘要:

函数$f : \mathbb{F}_2^n \to \mathbb{R}$是$s$ -稀疏的,如果它至多具有$s$非零傅立叶系数。出于应用程序的快速稀疏傅立叶变换在$\mathbb{F}_2^n$,我们研究有效的算法的问题,近似的$\ell_2$ -距离从一个给定的功能,最接近的$s$ -稀疏功能。虽然以前的作品(例如,Gopalan等人,SICOMP 2011)研究了在汉明距离下区分$s$ -稀疏函数与远离$s$ -稀疏的那些函数的问题,据我们所知,没有现有工作明确地集中在$\ell_2$设置中的距离估计的更一般的问题上,这对于有噪声的傅立叶谱特别有意义。考虑到对效率的关注,我们的主要结果是一个算法,解决了这个问题的查询复杂性$\mathcal{O}(s)$恒定的准确性和错误参数,这是只有二次差于适用的下限。

英文摘要:

A function $f : \mathbb{F}_2^n \to \mathbb{R}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. Motivated by applications to fast sparse Fourier transforms over $\mathbb{F}_2^n$, we study efficient algorithms for the problem of approximating the $\ell_2$-distance from a given function to the closest $s$-sparse function. While previous works (e.g., Gopalan et al. SICOMP 2011) study the problem of distinguishing $s$-sparse functions from those that are far from $s$-sparse under Hamming distance, to the best of our knowledge no prior work has explicitly focused on the more general problem of distance estimation in the $\ell_2$ setting, which is particularly well-motivated for noisy Fourier spectra. Given the focus on efficiency, our main result is an algorithm that solves this problem with query complexity $\mathcal{O}(s)$ for constant accuracy and error parameters, which is only quadratically worse than applicable lower bounds.

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

↑