Lasso Screening Rules via Dual Polytope Projection
arXiv:1211.3966
Abstract
Lasso is a widely used regression technique to find sparse representations. When the dimension of the feature space and the number of samples are extremely large, solving the Lasso problem remains challenging. To improve the efficiency of solving large-scale Lasso problems, El Ghaoui and his colleagues have proposed the SAFE rules which are able to quickly identify the inactive predictors, i.e., predictors that have components in the solution vector. Then, the inactive predictors or features can be removed from the optimization problem to reduce its scale. By transforming the standard Lasso to its dual form, it can be shown that the inactive predictors include the set of inactive constraints on the optimal dual solution. In this paper, we propose an efficient and effective screening rule via Dual Polytope Projections (DPP), which is mainly based on the uniqueness and nonexpansiveness of the optimal dual solution due to the fact that the feasible set in the dual space is a convex and closed polytope. Moreover, we show that our screening rule can be extended to identify inactive groups in group Lasso. To the best of our knowledge, there is currently no "exact" screening rule for group Lasso. We have evaluated our screening rule using synthetic and real data sets. Results show that our rule is more effective in identifying inactive predictors than existing state-of-the-art screening rules for Lasso.
References in corpus (4)
Cited by in corpus (35)
- Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
- Safe Screening With Variational Inequalities and Its Application to LASSO
- Mind the duality gap: safer rules for the Lasso
- Scaling SVM and Least Absolute Deviations via Exact Data Reduction
- Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs
- An Equivalence between the Lasso and Support Vector Machines
- GAP Safe screening rules for sparse multi-task and multi-class models
- Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets
- Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modeling
- Safe Screening for Multi-Task Feature Learning with Multiple Data Matrices
- Screening Rules for Overlapping Group Lasso
- WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models
- Fast OSCAR and OWL Regression via Safe Screening Rules
- Stable safe screening and structured dictionaries for faster L1 regularization
- The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation
- Safe Screening for the Generalized Conditional Gradient Method
- Accelerating Deep Learning with Shrinkage and Recall
- Feedback-Controlled Sequential Lasso Screening
- Learning Hierarchical Interactions at Scale: A Convex Optimization Approach
- Large-scale Feature Selection of Risk Genetic Factors for Alzheimer's Disease via Distributed Group Lasso Regression
- Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models
- Group Invariance and Computational Sufficiency
- Tuning parameter selection rules for nuclear norm regularized multivariate linear regression
- The Function-on-Scalar LASSO with Applications to Longitudinal GWAS
- Safe Screening Rules for -Regression
- Safe Screening for Sparse Conditional Random Fields
- Screening for Sparse Online Learning
- On Newton Screening
- Representing Sets as Summed Semantic Vectors
- Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values
- Accelerated Sparse Bayesian Learning via Screening Test and Its Applications
- Successive Ray Refinement and Its Application to Coordinate Descent for LASSO
- Safe Sample Screening for Robust Support Vector Machine
- Large-scale Collaborative Imaging Genetics Studies of Risk Genetic Factors for Alzheimer's Disease Across Multiple Institutions
- On Inductive Biases for Machine Learning in Data Constrained Settings