Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise

Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise

Thumbnail Image
Download
Name

Brown_Convergence and stability.pdf

Size

318.65 KB

Format

Adobe PDF

Checksum (MD5)

948d3e1e1704c8e4d56b655aa2324905

Author(s)
Babadi, Behtash
•
Brown, Emery N.
•
Ba, Demba E.
•
Purdon, Patrick Lee
Alternative Title
Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms
Date Issued
October 2013
Journal
IEEE Transactions on Signal Processing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ba, Demba, Behtash Babadi, Patrick L. Purdon, and Emery N. Brown. “Convergence and Stability of Iteratively Re-Weighted Least Squares Algorithms.” IEEE Transactions on Signal Processing 62, no. 1 (n.d.): 183–195.
Version
Original manuscript
Abstract
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) algorithms for constrained maximum likelihood estimation under a Gaussian scale mixture (GSM) distribution. The EM formalism, as well as the connection to GSMs, allow us to establish that the IRLS algorithms minimize smooth versions of the lν `norms', for . We leverage EM theory to show that the limit points of the sequence of IRLS iterates are stationary points of the smooth lν “norm” minimization problem on the constraint set. We employ techniques from Compressive Sampling (CS) theory to show that the IRLS algorithm is stable, if the limit point of the iterates coincides with the global minimizer. We further characterize the convergence rate of the IRLS algorithm, which implies global linear convergence for ν = 1 and local super-linear convergence for . We demonstrate our results via simulation experiments. The simplicity of IRLS, along with the theoretical guarantees provided in this contribution, make a compelling case for its adoption as a standard tool for sparse signal recovery.
MIT Department
Harvard University--MIT Division of Health Sciences and Technology
Massachusetts Institute of Technology. Department of Brain and Cognitive Sciences
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/86328
DOI of Published Version
https://doi.org/10.1109/TSP.2013.2287685
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.