The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
Abstract
Given a large overcomplete dictionary of basis vectors, the goal is to simultaneously represent L>1 signal vectors using coefficient expansions marked by a common sparsity profile. This generalizes the standard sparse representation problem to the case where multiple responses exist that were putatively generated by the same small subset of features. Ideally, the associated sparse generating weights should be recovered, which can have physical significance in many applications (e.g., source localization). The generic solution to this problem is intractable and, therefore, approximate procedures are sought. Based on the concept of automatic relevance determination, this paper uses an empirical Bayesian prior to estimate a convenient posterior distribution over candidate basis vectors. This particular approximation enforces a common sparsity profile and consistently places its prominent posterior mass on the appropriate region of weight-space necessary for simultaneous sparse recovery. The resultant algorithm is then compared with multiple response extensions of matching pursuit, basis pursuit, FOCUSS, and Jeffreys prior-based Bayesian methods, finding that it often outperforms the others. Additional motivation for this particular choice of cost function is also provided, including the analysis of global and local minima and a variational derivation that highlights the similarities and differences between the proposed algorithm and previous approaches.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Applied Multivariate Statistical Analysis.
Johnson, A. R., & Wichern, D. W. (1988) · Biometrics · doi:10.2307/2531616 · Cited by 11,353
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Cited by
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning
Zhang, Z., & Rao, B. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2159773 · Cited by 868
Self-citationYardibi, T., Li, J., Stoica, P., Xue, M., & Baggeroer, A. B. (2010) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2010.5417172 · Cited by 699
Huang, J., & Zhang, T. (2010) · The Annals of Statistics · doi:10.1214/09-aos778 · Cited by 521
Ji, S., Dunson, D., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2005866 · Cited by 502
Compressive Sensing in Electromagnetics - A Review
Massa, A., Rocca, P., & Oliveri, G. (2015) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2015.2397092 · Cited by 360
Compressed Sensing for Wireless Communications: Useful Tips and Tricks
Choi, J. W., Shim, B., Ding, Y., Rao, B., & Kim, D. I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2664421 · Cited by 351
Self-citationMultisnapshot Sparse Bayesian Learning for DOA
Gerstoft, P., Mecklenbrauker, C. F., Xenaki, A., & Nannuru, S. (2016) · IEEE Signal Processing Letters · doi:10.1109/lsp.2016.2598550 · Cited by 332
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Learning with Structured Sparsity
Huang, J., Zhang, T., & Metaxas, D. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.3002 · Cited by 275
Dictionary Learning-Based Sparse Channel Representation and Estimation for FDD Massive MIMO Systems
Ding, Y., & Rao, B. D. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2843786 · Cited by 161
Self-citationMultitask Sparse Bayesian Learning with Applications in Structural Health Monitoring
Huang, Y., Beck, J. L., & Li, H. (2019) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.12408 · Cited by 79
“…have been developed recently to solve such a multitask problem, often under the name of “Simultaneous Sparse Approximation” (Tropp et al., 2006; Wipf and Rao, 2007; Ollila, 2015) or “Group Lasso” (least absolute shrinkage and selection operator linear programming) (Huang and Zhang, 2010),…”
MethodInfluential
Metadata
- Authors
- Wipf, D. P., & Rao, B. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2007-07
- Volume
- 55
- Issue
- 7
- Pages
- 3704-3716
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2152279006
- Cited by
- 911
- References
- 57
- FWCI
- 16.14
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.