Screening Rules for Lasso with Non-Convex Sparse Regularizers

Abstract : Leveraging on the convexity of the Lasso problem , screening rules help in accelerating solvers by discarding irrelevant variables, during the optimization process. However, because they provide better theoretical guarantees in identifying relevant variables, several non-convex regulariz-ers for the Lasso have been proposed in the literature. This work is the first that introduces a screening rule strategy into a non-convex Lasso solver. The approach we propose is based on a iterative majorization-minimization (MM) strategy that includes a screening rule in the inner solver and a condition for propagating screened variables between iterations of MM. In addition to improve efficiency of solvers, we also provide guarantees that the inner solver is able to identify the zeros components of its critical point in finite time. Our experimental analysis illustrates the significant computational gain brought by the new screening rule compared to classical coordinate-descent or proximal gradient descent methods.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées
Contributeur : Alain Rakotomamonjy <>
Soumis le : mercredi 13 février 2019 - 14:56:44
Dernière modification le : jeudi 21 février 2019 - 01:31:04


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-02017967, version 1
  • ARXIV : 1902.06125


Alain Rakotomamonjy, Gilles Gasso, Joseph Salmon. Screening Rules for Lasso with Non-Convex Sparse Regularizers. 2019. 〈hal-02017967〉



Consultations de la notice


Téléchargements de fichiers