An Adaptive Ridge Procedure for L-0 Regularization

Abstract : Penalized selection criteria like AIC or BIC are among the most popular methods for variable selection. Their theoretical properties have been studied intensively and are well understood, but making use of them in case of high-dimensional data is difficult due to the non-convex optimization problem induced by L0 penalties. In this paper we introduce an adaptive ridge procedure (AR), where iteratively weighted ridge problems are solved whose weights are updated in such a way that the procedure converges towards selection with L0 penalties. After introducing AR its specific shrinkage properties are studied in the particular case of orthogonal linear regression. Based on extensive simulations for the non-orthogonal case as well as for Poisson regression the performance of AR is studied and compared with SCAD and adaptive LASSO. Furthermore an efficient implementation of AR in the context of least-squares segmentation is presented. The paper ends with an illustrative example of applying AR to analyze GWAS data.
Type de document :
Article dans une revue
PLoS ONE, Public Library of Science, 2016, 11 (2), pp.e0148620. 〈10.1371/journal.pone.0148620〉
Liste complète des métadonnées

Littérature citée [42 références]  Voir  Masquer  Télécharger
Contributeur : Gestionnaire Hal-Upmc <>
Soumis le : vendredi 26 février 2016 - 11:02:27
Dernière modification le : vendredi 4 janvier 2019 - 17:32:34
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 04:09:49


Publication financée par une institution


Distributed under a Creative Commons Paternité 4.0 International License



Florian Frommlet, Gregory Nuel. An Adaptive Ridge Procedure for L-0 Regularization. PLoS ONE, Public Library of Science, 2016, 11 (2), pp.e0148620. 〈10.1371/journal.pone.0148620〉. 〈hal-01279440〉



Consultations de la notice


Téléchargements de fichiers