Papers › Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression

Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression

16 Jul 2019NeurIPS 2019 12arXiv:1907.07167archive 2025-07-28

Deeksha Adil, Richard Peng, Sushant Sachdeva

Linear regression in ℓₚ-norm is a canonical optimization problem that arises in several applications, including sparse recovery, semi-supervised learning, and signal processing. Generic convex optimization algorithms for solving ℓₚ-regression are slow in practice. Iteratively Reweighted Least Squares (IRLS) is an easy to implement family of algorithms for solving these problems that has been studied for over 50 years. However, these algorithms often diverge for p > 3, and since the work of Osborne (1985), it has been an open problem whether there is an IRLS algorithm that is guaranteed to converge rapidly for p > 3. We propose p-IRLS, the first IRLS algorithm that provably converges geometrically for any p ∈[2,∞). Our algorithm is simple to implement and is guaranteed to find a (1+ε)-approximate solution in O(p^(3.5) m^((p-2)/(2(p-1))) logm/ε) ≤Oₚ(√(m) logm/ε ) iterations. Our experiments demonstrate that it performs even better than our theoretical bounds, beats the standard Matlab/CVX implementation for solving these problems by 10--50x, and is the fastest among available implementations in the high-accuracy regime.

PaperPDFConference PDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

utoronto-theory/pIRLS officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

regression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections