Unitary Approximate Message Passing for Sparse Bayesian Learning

Abstract

Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it does not work well for a generic measurement matrix, which may cause AMP to diverge. Damped AMP has been used for SBL to alleviate the problem at the cost of reducing convergence speed. In this work, we propose a new SBL algorithm based on structured variational inference, leveraging AMP with a unitary transformation (UAMP). Both single measurement vector and multiple measurement vector problems are investigated. It is shown that, compared to state-of-the-art AMP-based SBL algorithms, the proposed UAMP-SBL is more robust and efficient, leading to remarkably better performance.

References in corpus (6)

• Structured Compressed Sensing: From Theory to Applications
• A Generalized Mean Field Algorithm for Variational Inference in Exponential Families
• Approximate Message Passing with Unitary Transformation
• Approximate Message Passing with Unitary Transformation for Robust Bilinear Recovery
• Sparse Estimation with the Swept Approximated Message-Passing Algorithm
• Convolutional Approximate Message-Passing