arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.13855cs.ITeess.SPmath.IT
收藏

L2噪声范数下SOMP成功恢复性能保证

Successful Recovery Performance Guarantees of SOMP Under the L2-norm of Noise

Wei Zhang, Taejoon Kim

AI总结:

本文基于互不相干性分析含噪SOMP的性能,给出有界噪声下精确支撑恢复条件及无界高斯噪声下服从Tracy-Widom定律的成功恢复概率下界,并揭示测量数、噪声水平、稀疏向量数量与互相干之间的理论关系。

摘要:

同时正交匹配追踪(SOMP)是一种流行的贪婪方法,用于行稀疏矩阵的公共支撑恢复。然而,与无噪声场景相比,含噪SOMP的性能分析仍处于起步阶段,尤其是在无界噪声场景下。本文基于互不相干性(MIP)提出了一项针对含噪SOMP性能分析的新研究。具体而言,当噪声有界时,我们给出了在MIP意义下保证精确支撑恢复的条件。当噪声无界时,我们转而推导出成功恢复概率(SRP)的界,该界依赖于噪声矩阵$\ell_2$-范数的具体分布。随后,我们聚焦于噪声为随机高斯的常见情形,并证明SRP的下界服从Tracy-Widom定律分布。该分析揭示了为保证预定义恢复性能所需的测量数、噪声水平、稀疏向量数量以及互相干值。理论上,我们证明测量矩阵的互相干必须与噪声标准差成比例地减小,且稀疏向量的数量需要与噪声方差成比例地增长。最后,我们通过数值仿真广泛验证了所推导的分析。

英文摘要:

The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent, especially in the scenario of unbounded noise. In this paper, we present a new study based on the mutual incoherence property (MIP) for performance analysis of noisy SOMP. Specifically, when noise is bounded, we provide the condition on which the exact support recovery is guaranteed in terms of the MIP. When noise is unbounded, we instead derive a bound on the successful recovery probability (SRP) that depends on the specific distribution of the $\ell_2$-norm of the noise matrix. Then we focus on the common case when noise is random Gaussian and show that the lower bound of SRP follows Tracy-Widom law distribution. The analysis reveals the number of measurements, noise level, the number of sparse vectors, and the value of mutual coherence that are required to guarantee a predefined recovery performance. Theoretically, we show that the mutual coherence of the measurement matrix must decrease proportionally to the noise standard deviation, and the number of sparse vectors needs to grow proportionally to the noise variance. Finally, we extensively validate the derived analysis through numerical simulations.

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

↑