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.
稀疏性是实向量的一个基本属性,在各种各样的应用中被利用。在这项工作中,我们描述了属性测试算法的稀疏性,观察输入的低维投影。我们考虑两种设置。在第一种设置中,对于R^{d x m}中的给定设计矩阵A,我们测试R^d中的输入向量y是否等于某个k稀疏单位向量x的Ax。我们的算法将输入投影到O(k \eps^{-2} log m)维上,如果属性成立则接受,如果属性成立则拒绝。||y轴||> \eps对于任何O(k/ \eps^2)-稀疏向量x,并且在m中以时间多项式运行。我们的算法是基于近似Caratheodory定理。以前已知的算法,解决问题的任意A与定性相似的保证运行在指数时间。在第二设置中,设计矩阵A是未知的。给定输入向量y_1,y_2,.,y_p在R^d中,其作为列的级联形成R^{d x p}中的Y,目标是决定对于R^{d x m}中的矩阵A和R^{m x p}中的矩阵X,Y是否=AX,使得X的每一列是k-稀疏的,或者Y是否“远离”具有这样的分解。我们给出了这样一个测试算法,它将输入向量投影到O(logp/ \eps^2)维,并假设未知数A满足k-限制等距.我们的分析给出了一个新的强大的高斯宽度的稀疏性方面的表征。
The Ohio State University(俄亥俄州立大学);Harvard University(哈佛大学);Agency for Science, Technology and Research (A*STAR)(新加坡科技研究局);Singapore University of Technology and Design(新加坡科技设计大学)