一种无偏的压缩感知方法
An unbiased approach to compressed sensing
摘要:
在压缩感知中,稀疏向量是从欠定方程组$Ax=b$中近似获取的。精确检索意味着解决一个大型的组合问题,这是众所周知的NP-难。对于形式为$Ax_0+ε$的$b$,其中$x_0$和$ε$是噪声,如果您先验地知道$x_0$的支持,则“oracle解决方案”是您得到的解决方案,并且是人们所希望的最佳解决方案。我们提供了一个非凸泛函,它的全局极小值是oracle解,具有任何其他局部极小值必然具有高基数的性质。我们提供的估计类型$\|\hat x-x_0\|_2\leq C\|ε\|_2$与常数$C$是显着低于竞争的方法或定理,我们的理论依赖于软假设的矩阵$A$,在比较标准的结果在该领域。该框架还允许将所寻求的向量的基数的先验信息。在这种情况下,我们表明,尽管是非凸的,我们的成本功能没有虚假的局部最小值和全局最小值再次是“预言解决方案”,从而提供了第一种方法,保证找到这一点的合理水平的噪音,而不诉诸组合方法。
英文摘要:
In compressed sensing a sparse vector is approximately retrieved from an under-determined equation system $Ax=b$. Exact retrieval would mean solving a large combinatorial problem which is well known to be NP-hard. For $b$ of the form $Ax_0+ε$ where $x_0$ and $ε$ is noise, the `oracle solution' is the one you get if you a priori know the support of $x_0$, and is the best solution one could hope for. We provide a non-convex functional whose global minimum is the oracle solution, with the property that any other local minimizer necessarily has high cardinality. We provide estimates of the type $\|\hat x-x_0\|_2\leq C\|ε\|_2$ with constants $C$ that are significantly lower than for competing methods or theorems, and our theory relies on soft assumptions on the matrix $A$, in comparison with standard results in the field. The framework also allows to incorporate a priori information on the cardinality of the sought vector. In this case we show that despite being non-convex, our cost functional has no spurious local minima and the global minima is again the `oracle solution', thereby providing the first method which is guaranteed to find this point for reasonable levels of noise, without resorting to combinatorial methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。