arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.03044cs.LGstat.ML
收藏

基于GAMP的低复杂度稀疏贝叶斯学习算法

A GAMP Based Low Complexity Sparse Bayesian Learning Algorithm

University of California, San Diego(加利福尼亚大学圣地亚哥分校);The Ohio State University(俄亥俄州立大学)

Maher Al-Shoukairi, Philip Schniter, Bhaskar D. Rao

摘要:

在本文中,我们提出了一种算法的稀疏信号恢复问题,将阻尼高斯广义近似消息传递(GGAMP)的期望最大化(EM)为基础的稀疏贝叶斯学习(SBL)。特别是,GGAMP用于在SBL中实现E步,代替矩阵求逆,利用GGAMP保证以适当的阻尼收敛的事实。GGAMP-SBL算法比标准阻尼GAMP算法对任意测量矩阵$\boldsymbol{A}$具有更强的鲁棒性,同时比标准SBL算法具有更低的复杂度。然后,我们扩展的方法从单测量矢量(SMV)的情况下,时间相关的多个测量矢量(MMV)的情况下,导致GGAMP-TSBL算法。我们通过数值实验验证了所提出的算法的鲁棒性和计算优势。

英文摘要:

In this paper, we present an algorithm for the sparse signal recovery problem that incorporates damped Gaussian generalized approximate message passing (GGAMP) into Expectation-Maximization (EM)-based sparse Bayesian learning (SBL). In particular, GGAMP is used to implement the E-step in SBL in place of matrix inversion, leveraging the fact that GGAMP is guaranteed to converge with appropriate damping. The resulting GGAMP-SBL algorithm is much more robust to arbitrary measurement matrix $\boldsymbol{A}$ than the standard damped GAMP algorithm while being much lower complexity than the standard SBL algorithm. We then extend the approach from the single measurement vector (SMV) case to the temporally correlated multiple measurement vector (MMV) case, leading to the GGAMP-TSBL algorithm. We verify the robustness and computational advantages of the proposed algorithms through numerical experiments.

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

↑