The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A GAMP-Based Low Complexity Sparse Bayesian Learning Algorithm
Open accessAbstract
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-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 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 case to the temporally correlated multiple measurement vector case, leading to the GGAMP-TSBL algorithm. We verify the robustness and computational advantages of the proposed algorithms through numerical experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“the measurements using the EM algorithm. The EM algorithm can also be used to learn the correlation coefficient βand the noise variance σ2. Based on these assumptions we use the sum-product algorithm [46] to construct the factor graph in Fig. 3, and derive the MMV algorithm GGAMP-TSBL. In the MMV factor graph, the fact…”
MethodSparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Self-citation
Cited by
Yan, W., Yuan, X., He, Z.-Q., & Kuai, X. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3000811 · Cited by 280
Metadata
- Authors
- Al-Shoukairi, M., Schniter, P., & Rao, B. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-01-15
- Volume
- 66
- Issue
- 2
- Pages
- 294-308
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2596873572
- Cited by
- 176
- References
- 2
- FWCI
- 10.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A GAMP-Based Low Complexity Sparse Bayesian Learning Algorithm. https://app.cochat.ai/papers/10.1109/tsp.2017.2764855
- The paper
- Al-Shoukairi, M., Schniter, P., & Rao, B. D. (2018). A GAMP-Based Low Complexity Sparse Bayesian Learning Algorithm. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2017.2764855
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.