A safe reinforced feature screening strategy for Lasso based on feasible solutions
From MaRDI portal
Publication:2201661
DOI10.1016/J.INS.2018.10.031zbMATH Open1442.68199OpenAlexW2897945931WikidataQ129038357 ScholiaQ129038357MaRDI QIDQ2201661FDOQ2201661
Authors: Xianli Pan, Yitian Xu 
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.031
Recommendations
- Lasso screening rules via dual polytope projection
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems
- Gap safe screening rules for sparsity enforcing penalties
- Safe Feature Elimination in Sparse Supervised Learning
- Strong Rules for Discarding Predictors in Lasso-Type Problems
Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cites Work
- BLITZ
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Regularization and Variable Selection Via the Elastic Net
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Coordinate descent algorithms
- Safe Feature Elimination in Sparse Supervised Learning
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
- IsoLasso
- Scaling up twin support vector regression with safe screening rule
Cited In (4)
Uses Software
This page was built for publication: A safe reinforced feature screening strategy for Lasso based on feasible solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201661)
