A Dynamic Screening Principle for the Lasso - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Dynamic Screening Principle for the Lasso

Résumé

The Lasso is an optimization problem devoted to finding a sparse representation of some signal with respect to a predefined dictionary. An original and computationally-efficient method is proposed here to solve this problem, based on a dynamic screening principle. It makes it possible to accelerate a large class of optimization algorithms by iteratively reducing the size of the dictionary during the optimization process, discarding elements that are provably known not to belong to the solution of the Lasso. The iterative reduction of the dictionary is what we call dynamic screening. As this screening step is inexpensive, the computational cost of the algorithm using our dynamic screening strategy is lower than that of the base algorithm. Numerical experiments on synthetic and real data support the relevance of this approach.
Fichier principal
Vignette du fichier
DynScreen_CameraReady_240614.pdf (267.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00880787 , version 1 (06-11-2013)
hal-00880787 , version 2 (08-11-2013)
hal-00880787 , version 3 (11-03-2014)
hal-00880787 , version 4 (24-06-2014)

Identifiants

  • HAL Id : hal-00880787 , version 4

Citer

Antoine Bonnefoy, Valentin Emiya, Liva Ralaivola, Rémi Gribonval. A Dynamic Screening Principle for the Lasso. European Signal Processing Conference EUSIPCO 2014, Sep 2014, Lisboa, Portugal. pp.1-5. ⟨hal-00880787v4⟩
1053 Consultations
3619 Téléchargements

Partager

Gmail Facebook X LinkedIn More