Lasso Screening Rules via Dual Polytope Projection
Jie Wang, Peter Wonka, Jieping Ye

TL;DR
This paper introduces a new screening rule based on dual polytope projections that efficiently identifies inactive predictors in large-scale Lasso problems, significantly reducing computational complexity.
Contribution
It proposes an exact screening rule for Lasso and extends it to group Lasso, improving predictor elimination efficiency over existing methods.
Findings
The screening rule effectively identifies inactive predictors in synthetic and real datasets.
It outperforms existing screening rules in terms of accuracy and efficiency.
The method is applicable to large-scale high-dimensional problems.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Bayesian Methods and Mixture Models · Systemic Lupus Erythematosus Research
