A safe reinforced feature screening strategy for Lasso based on feasible solutions
From MaRDI portal
Publication:2201661
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
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Atomic Decomposition by Basis Pursuit
- BLITZ
- Coordinate descent algorithms
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- IsoLasso
- Regularization and Variable Selection Via the Elastic Net
- Safe Feature Elimination in Sparse Supervised Learning
- Scaling up twin support vector regression with safe screening rule
- Strong Rules for Discarding Predictors in Lasso-Type Problems
Cited in
(7)- Sequential safe feature elimination rule for \(L_1\)-regularized regression with Kullback-Leibler divergence
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems
- Lasso screening rules via dual polytope projection
- Safe Feature Elimination in Sparse Supervised Learning
- A safe double screening strategy for elastic net support vector machine
- Safe feature screening rules for the regularized Huber regression
- Variable screening for Lasso based on multidimensional indexing
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)
