A Concise Tutorial on Approximate Message Passing

Abstract

High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by Donoho et al is a computational efficient method to such problems, which can attain Bayes-optimal performance in independent identical distributed (IID) sub-Gaussian random matrices region. A significant feature of AMP is that the dynamical behavior of AMP can be fully predicted by a scalar equation termed station evolution (SE). Although AMP is optimal in IID sub-Gaussian random matrices, AMP may fail to converge when measurement matrix is beyond IID sub-Gaussian. To extend the region of random measurement matrix, an expectation propagation (EP)-related algorithm orthogonal AMP (OAMP) was proposed, which shares the same algorithm with EP, expectation consistent (EC), and vector AMP (VAMP). This paper aims at giving a review for those algorithms. We begin with the worst case, i.e. least absolute shrinkage and selection operator (LASSO) inference problem, and then give the detailed derivation of AMP derived from message passing. Also, in the Bayes-optimal setting, we give the Bayes-optimal AMP which has a slight difference from AMP for LASSO. In addition, we review some AMP-related algorithms: OAMP, VAMP, and Memory AMP (MAMP), which can be applied to more general random matrices.

Approximate Message Passing Detector for Phase-Shifter-Aided Spatial Multiplexing

“…2 is similar to that of AMP, thereby some of the approximations in AMP make sense [9], [16]. The approximation process will not be detailed here due to the space limitation, and interested readers are referred to [17]. The approximation results are given in the following variables as:…”

Hybrid Far- and Near-Field Channel Estimation for THz Ultra-Massive MIMO via Fixed Point Networks

“…For hybrid analog-digital transceivers, we consider the general system model (9) for CS-based channel estimation. Under such circumstances, Bayes-optimal estimation can be achieved by orthogonal AMP (OAMP) 3 [41], [42], an iterative algorithm with the following update rules consisting of a linear estimator (LE) and a non-linear estimator (NLE), i.e., OAMP-LE:…”

Iterative Signal Detection and Channel Estimation with Superimposed Training Sequences for Underwater Acoustic Information Transmission in Time-Varying Environments

“…The BP algorithm exhibits high computational complexity and limited adaptability. As a result, Donoho proposed the AMP algorithm [10], which shares significant similarities with the iterative shrinkage threshold algorithm (ISTA) regarding its form and the Onsager term [11]. Despite this resemblance, AMP's derivation process relies on message passing algorithm approximation: hence, it is named the approximate message passing algorithm.…”