2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2015
DOI: 10.1109/icassp.2015.7178325
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive damping and mean removal for the generalized approximate message passing algorithm

Abstract: The generalized approximate message passing (GAMP) algorithm is an efficient method of MAP or approximate-MMSE estimation of x observed from a noisy version of the transform coefficients z = Ax. In fact, for large zero-mean i.i.d sub-Gaussian A, GAMP is characterized by a state evolution whose fixed points, when unique, are optimal. For generic A, however, GAMP may diverge. In this paper, we propose adaptive-damping and mean-removal strategies that aim to prevent divergence. Numerical results demonstrate signi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
169
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 145 publications
(172 citation statements)
references
References 19 publications
3
169
0
Order By: Relevance
“…drawn from N (0, 1). Set the range of γ to [0, 1, 1.8, 1.9, 1.95, 2,3,4,5,6,7,8,9,10,11,12]. Figure 1a shows that GAMP violently diverges at γ = 2, AMP fast diverges at γ = 5.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…drawn from N (0, 1). Set the range of γ to [0, 1, 1.8, 1.9, 1.95, 2,3,4,5,6,7,8,9,10,11,12]. Figure 1a shows that GAMP violently diverges at γ = 2, AMP fast diverges at γ = 5.…”
Section: Methodsmentioning
confidence: 99%
“…They work very well in the zero-mean Gaussian sensing matrix case, but become unstable and divergent in the more general sensing matrix case. For example, although an improvement to the non-zero mean Gaussian sensing matrix case has in a sense been proposed [4], the highly columns-correlated non-Gaussian sensing matrix case is still a problem. We propose a new GAMP-like algorithm, termed Bernoulli-Gaussian Pursuit GAMP (BGP-GAMP), to raise the robustness of standard GAMP algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…While the fixed points of the sum-product GAMP algorithm correspond to local minima of the LSL-BFE minimization in (4), the sum-product GAMP algorithm may not always converge (see, e.g., the negative results in [7], [8], [10]). We thus consider an alternative minimization strategy based on a generalization of the classic double-loop method known as the concave convex procedure (CCCP) [16].…”
Section: B Outer Loop Minimization Via Iterative Linearizationmentioning
confidence: 99%
“…Several recent modifications have been proposed to improve the stability of AMP, including damping [7], sequential updating [9], and adaptive damping [10], some of which have been instrumental in applications such as [11]- [13]. However, while these methods appear to perform empirically well, little has been proven rigorously about their convergence.…”
Section: Introductionmentioning
confidence: 99%
“…measurement matrices [21], however, they do not necessarily converge for generic matrices [22]. There have been some attempts to prevent divergence of AMP-based methods [14,23,24]. In [14], the authors show that a simple change in the main AMP loop may stabilize AMP significantly.…”
Section: Prsamp Algorithmmentioning
confidence: 99%