Efficientℓ₀‐norm feature selection based on augmented and penalized minimization

Citations Over TimeTop 10% of 2017 papers

Abstract

Advances in high-throughput technologies in genomics and imaging yield unprecedentedly large numbers of prognostic biomarkers. To accommodate the scale of biomarkers and study their association with disease outcomes, penalized regression is often used to identify important biomarkers. The ideal variable selection procedure would search for the best subset of predictors, which is equivalent to imposing an ℓ₀ -penalty on the regression coefficients. Since this optimization is a nondeterministic polynomial-time hard (NP-hard) problem that does not scale with number of biomarkers, alternative methods mostly place smooth penalties on the regression parameters, which lead to computationally feasible optimization problems. However, empirical studies and theoretical analyses show that convex approximation of ℓ₀ -norm (eg, ℓ₁ ) does not outperform their ℓ₀ counterpart. The progress for ℓ₀ -norm feature selection is relatively slower, where the main methods are greedy algorithms such as stepwise regression or orthogonal matching pursuit. Penalized regression based on regularizing ℓ₀ -norm remains much less explored in the literature. In this work, inspired by the recently popular augmenting and data splitting algorithms including alternating direction method of multipliers, we propose a 2-stage procedure for ℓ₀ -penalty variable selection, referred to as augmented penalized minimization-L₀ (APM-L₀ ). The APM-L₀ targets ℓ₀ -norm as closely as possible while keeping computation tractable, efficient, and simple, which is achieved by iterating between a convex regularized regression and a simple hard-thresholding estimation. The procedure can be viewed as arising from regularized optimization with truncated ℓ₁ norm. Thus, we propose to treat regularization parameter and thresholding parameter as tuning parameters and select based on cross-validation. A 1-step coordinate descent algorithm is used in the first stage to significantly improve computational efficiency. Through extensive simulation studies and real data application, we demonstrate superior performance of the proposed method in terms of selection accuracy and computational speed as compared to existing methods. The proposed APM-L₀ procedure is implemented in the R-package APML0.

Related Papers

• → Cluster feature selection in high-dimensional linear models(2017)1 cited
• → A Two-Step Feature Selection Procedure to Handle High-Dimensional Data in Regression Problems(2023)1 cited
• → Elastic Net based Feature Ranking and Selection(2020)3 cited
• Comparison of Feature Selection Methods Based on Lasso(2014)