A Safe Screening Rule for Sparse Logistic Regression
Not on the map. Why?
Abstract (arXiv)
The l1-regularized logistic regression (or sparse logistic regression) is a widely used method for simultaneous classification and feature selection. Although many recent efforts have been devoted to its efficient implementation, its application to high dimensional data still poses significant challenges. In this paper, we present a fast and effective sparse logistic regression screening rule (Slores) to identify the 0 components in the solution vector, which may lead to a substantial reduction in the number of features to be entered to the optimization. An appealing feature of Slores is that the data set needs to be scanned only once to run the screening and its computational cost is negligible compared to that of solving the sparse logistic regression problem. Moreover, Slores is independent of solvers for sparse logistic regression, thus Slores can be integrated with any existing solver to improve the efficiency. We have evaluated Slores using high-dimensional data sets from different applications. Extensive experimental results demonstrate that Slores outperforms the existing state-of-the-art screening rules and the efficiency of solving sparse logistic regression is improved by one magnitude in general.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jul 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 3; 2024: 3; 2025: 2; 2026: 2.
14 papers.
Sort:
- 2022Safe Screening for Logistic Regression with ℓ0-ℓ2 Regularizationcited by 6
- 2023The Challenge of Differentially Private Screening Rulescited by 6
- 2021The Hessian Screening Rulecited by 3
- 2023Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modificationscited by 3
- 2021Screening for Sparse Online Learningcited by 2
- 2023One to beat them all: "RYU" -- a unifying framework for the construction of safe ballscited by 2
- 2024Strong Screening Rules for Group-based SLOPE Modelscited by 2
- 2025Differentially Private Iterative Screening Rules for Linear Regressioncited by 2
- 2026Safe Distributionally Robust Feature Selection under Covariate Shiftcited by 1
- 2021Safe Screening for Sparse Conditional Random Fieldscited by 0
- 2024A Safe Screening Rule with Bi-level Optimization of nu Support Vector Machinecited by 0
- 2024Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variantcited by 0
2 more
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasets21 Sep 2026
- 2026Safe Distributionally Robust Feature Selection under Covariate Shift17 Mar 2026
- 2025Safe Screening Rules for Group SLOPE11 Jun 2025
- 2025Differentially Private Iterative Screening Rules for Linear Regression25 Feb 2025
- 2024Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant27 May 2024
- 2024Strong Screening Rules for Group-based SLOPE Models24 May 2024
- 2024A Safe Screening Rule with Bi-level Optimization of nu Support Vector Machine4 Mar 2024
- 2023One to beat them all: "RYU" -- a unifying framework for the construction of safe balls1 Dec 2023
- 2023Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications22 Jun 2023
- 2023The Challenge of Differentially Private Screening Rules18 Mar 2023
- 2022Safe Screening for Logistic Regression with ℓ0-ℓ2 Regularization1 Feb 2022
- 2021Safe Screening for Sparse Conditional Random Fields27 Nov 2021
2 more
- 2021The Hessian Screening Rule27 Apr 2021
- 2021Screening for Sparse Online Learning18 Jan 2021
- 2022Safe Screening for Logistic Regression with ℓ0-ℓ2 Regularizationcited by 6
- 2023The Challenge of Differentially Private Screening Rulescited by 6
- 2021The Hessian Screening Rulecited by 3
- 2023Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modificationscited by 3
- 2021Screening for Sparse Online Learningcited by 2
- 2023One to beat them all: "RYU" -- a unifying framework for the construction of safe ballscited by 2
- 2024Strong Screening Rules for Group-based SLOPE Modelscited by 2
- 2025Differentially Private Iterative Screening Rules for Linear Regressioncited by 2
- 2026Safe Distributionally Robust Feature Selection under Covariate Shiftcited by 1
- 2021Safe Screening for Sparse Conditional Random Fieldscited by 0
- 2024A Safe Screening Rule with Bi-level Optimization of nu Support Vector Machinecited by 0
- 2024Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variantcited by 0
12 most cited of 14 All 14 (JSON)
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasets21 Sep 2026
- 2026Safe Distributionally Robust Feature Selection under Covariate Shift17 Mar 2026
- 2025Safe Screening Rules for Group SLOPE11 Jun 2025
- 2025Differentially Private Iterative Screening Rules for Linear Regression25 Feb 2025
- 2024Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant27 May 2024
- 2024Strong Screening Rules for Group-based SLOPE Models24 May 2024
- 2024A Safe Screening Rule with Bi-level Optimization of nu Support Vector Machine4 Mar 2024
- 2023One to beat them all: "RYU" -- a unifying framework for the construction of safe balls1 Dec 2023
- 2023Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications22 Jun 2023
- 2023The Challenge of Differentially Private Screening Rules18 Mar 2023
- 2022Safe Screening for Logistic Regression with ℓ0-ℓ2 Regularization1 Feb 2022
- 2021Safe Screening for Sparse Conditional Random Fields27 Nov 2021
12 newest of 14 All 14 (JSON)