Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise
In this paper, we study the theoretical properties of iteratively re-weighted least squares (IRLS) algorithms and their utility in sparse signal recovery in the presence of noise. We demonstrate a one-to-one correspondence between the IRLS algorithms and a class of Expectation-Maximization (EM) algo...
Main Authors: | Babadi, Behtash (Contributor), Brown, Emery N. (Contributor), Ba, Demba E. (Contributor), Purdon, Patrick Lee (Contributor) |
---|---|
Other Authors: | Harvard University- (Contributor), Massachusetts Institute of Technology. Department of Brain and Cognitive Sciences (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2014-05-01T16:00:50Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Robust spectrotemporal decomposition by iteratively reweighted least squares
by: Babadi, Behtash, et al.
Published: (2015) -
Exact and stable recovery of sequences of signals with sparse increments via differential ℓ [subscript 1]-minimization
by: Ba, Demba E., et al.
Published: (2015) -
Sparse spectral estimation from point process observations
by: Miran, Sina, et al.
Published: (2017) -
Iteratively Reweighted Least Squares Algorithm for Sparse Principal Component Analysis with Application to Voting Records
by: Tomáš Masák
Published: (2017-09-01) -
Linear least squares problem for sparse matrix
by: LI, GENG, et al.
Published: (1986)