We consider the problem of learning an unknown $f$ with a sparse Fourier spectrum in the presence of outlier noise. In particular, the algorithm has access to a noisy oracle for (an unknown) $f$ such that (i) the Fourier spectrum of $f$ is $k$-sparse; (ii) at any query point $x$, the oracle returns $y$ such that with probability $1-ρ$, $|y-f(x)| \le ε$. However, with probability $ρ$, the error $y-f(x)$ can be arbitrarily large.
We study Fourier sparse functions over both the discrete cube $\{0,1\}^n$ and the torus $[0,1)$ and for both these domains, we design efficient algorithms which can tolerate any $ρ<1/2$ fraction of outliers. We note that the analogous problem for low-degree polynomials has recently been studied in several works~[AK03, GZ16, KKP17] and similar algorithmic guarantees are known in that setting.
While our main results pertain to the case where the location of the outliers, i.e., $x$ such that $|y-f(x)|>ε$ is randomly distributed, we also study the case where the outliers are adversarially located. In particular, we show that over the torus, assuming that the Fourier transform satisfies a certain \emph{granularity} condition, there is a sample efficient algorithm to tolerate $ρ=Ω(1)$ fraction of outliers and further, that this is not possible without such a granularity condition. Finally, while not the principal thrust, our techniques also allow us non-trivially improve on learning low-degree functions $f$ on the hypercube in the presence of adversarial outlier noise.
Our techniques combine a diverse array of tools from compressive sensing, sparse Fourier transform, chaining arguments and complex analysis.
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
给定一个图,稀疏割问题要求顶点的一个子集,其边扩展(由子集给出的归一化割)是最小的。在本文中,我们研究了这个问题的推广寻求$ k $不相交的顶点子集(集群)的所有边缘扩展是小的,此外,在外部的子集(离群点)的顶点数也很小。我们证明了,虽然这个问题是$ NP-$硬树,它可以解决在多项式时间的所有加权树,只要我们限制搜索空间的子集,诱导连通子图。该算法是基于动态规划和运行在最坏的情况下在$ O(k^2 n^3) $,当$ n $是顶点的数量和$ k $是簇的数量。当聚类数和离群值的数量由一个常数限制时,它也在线性时间内运行。
Outlier-Robust Sparse Estimation via Non-Convex Optimization
Brown University(布朗大学);University of Wisconsin-Madison(威斯康星大学麦迪逊分校);Duke University(杜克大学);University of Texas at Austin(德克萨斯大学奥斯汀分校);University of California, San Diego(加利福尼亚大学圣迭戈分校);University of Southern California(南加利福尼亚大学);University of Illinois at Chicago(伊利诺伊大学芝加哥分校)
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
在本文中,我们考虑了广泛研究的问题,计算一个$k$稀疏近似的$d$维傅立叶变换的长度$n$信号。我们的算法使用$O(k \log k \log n)$样本,是无量纲的,适用于任何宇宙大小,并实现了最强的$\ell_\infty/\ell_2$保证,同时运行时间可与快速傅立叶变换相媲美。与以前的算法,无论是通过限制等距属性或通过过滤功能进行对比,我们的方法提供了一个新的视角稀疏傅立叶变换问题。