A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
Lin Xiao, Tong Zhang

TL;DR
This paper introduces a homotopy continuation method for solving the -regularized least-squares problem, achieving fast convergence by exploiting local linear convergence and ensuring sparsity along the solution path.
Contribution
It provides the first theoretical analysis showing that a homotopy strategy guarantees global geometric convergence for sparse recovery problems.
Findings
Overall iteration complexity is O(log(1/psilon))
Method ensures all iterates along the path remain sparse
Empirical results support theoretical convergence claims
Abstract
We consider solving the -regularized least-squares (-LS) problem in the context of sparse recovery, for applications such as compressed sensing. The standard proximal gradient method, also known as iterative soft-thresholding when applied to this problem, has low computational cost per iteration but a rather slow convergence rate. Nevertheless, when the solution is sparse, it often exhibits fast linear convergence in the final stage. We exploit the local linear convergence using a homotopy continuation strategy, i.e., we solve the -LS problem for a sequence of decreasing values of the regularization parameter, and use an approximate solution at the end of each stage to warm start the next stage. Although similar strategies have been studied in the literature, there have been no theoretical analysis of their global iteration complexity. This paper shows that under…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Microwave Imaging and Scattering Analysis · Numerical methods in inverse problems
