arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.0480cs.ITmath.ITstat.ML
收藏

噪声压缩感知中SOCP算法的问题相关性分析

A problem dependent analysis of SOCP algorithms in noisy compressed sensing

Mihailo Stojnic

摘要:

由于\cite{CRT,CanRomTao06,DonohoPol}的结果,具有稀疏解的欠定线性方程组在过去的几年里一直是广泛研究的主题。本文考虑欠定线性系统的\emph{noisy}。在突破性的\cite{CanRomTao06}中,建立了在\emph{noisy}系统中,对于欠确定性的任何线性水平,存在线性稀疏性,其可以通过SOCP(二阶锥规划)优化算法恢复\emph{approximately},使得近似解向量(在$\ell_2$ -范数意义上)保证与稀疏未知向量的距离不比噪声的常数倍更远。在我们最近的工作\cite{StojnicGenSocp10},我们建立了一个替代框架,可用于统计性能分析的SOCP算法。为了演示该框架如何工作,我们在\cite{StojnicGenSocp10}中展示了如何使用它来精确表征SOCP的\emph{generic}(最差情况)性能。在本文中,我们提出了一套不同的结果,可以通过\cite{StojnicGenSocp10}的框架。其结果将与SOCP的\emph{problem dependent}性能分析有关。我们将考虑特定类型的未知稀疏向量,并描述SOCP用于恢复此类向量时的性能。我们还将表明,我们的理论预测是在一个坚实的协议,可以通过数值模拟得到的结果。

英文摘要:

Under-determined systems of linear equations with sparse solutions have been the subject of an extensive research in last several years above all due to results of \cite{CRT,CanRomTao06,DonohoPol}. In this paper we will consider \emph{noisy} under-determined linear systems. In a breakthrough \cite{CanRomTao06} it was established that in \emph{noisy} systems for any linear level of under-determinedness there is a linear sparsity that can be \emph{approximately} recovered through an SOCP (second order cone programming) optimization algorithm so that the approximate solution vector is (in an $\ell_2$-norm sense) guaranteed to be no further from the sparse unknown vector than a constant times the noise. In our recent work \cite{StojnicGenSocp10} we established an alternative framework that can be used for statistical performance analysis of the SOCP algorithms. To demonstrate how the framework works we then showed in \cite{StojnicGenSocp10} how one can use it to precisely characterize the \emph{generic} (worst-case) performance of the SOCP. In this paper we present a different set of results that can be obtained through the framework of \cite{StojnicGenSocp10}. The results will relate to \emph{problem dependent} performance analysis of SOCP's. We will consider specific types of unknown sparse vectors and characterize the SOCP performance when used for recovery of such vectors. We will also show that our theoretical predictions are in a solid agreement with the results one can get through numerical simulations.

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

↑