Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression
arXiv:1907.07167
Abstract
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 Our algorithm is simple to implement and is guaranteed to find a -approximate solution in 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.
Code for this work is available at https://github.com/utoronto-theory/pIRLS
References in corpus (8)
- Asymptotic behavior of -based Laplacian regularization in semi-supervised learning
- Hamiltonian Descent Methods
- Algorithms for Lipschitz Learning on Graphs
- IRLS and Slime Mold: Equivalence and Convergence
- Fast minimization of structured convex quartics
- Iterative Design of L_p Digital Filters
- Nonlocal -Laplacian Variational problems on graphs
- Faster p-norm minimizing flows, via smoothed q-norm problems