An Extended Newton-type Algorithm for -Regularized Sparse Logistic Regression and Its Efficiency for Classifying Large-scale Datasets
arXiv:1901.02768 · doi:10.1016/j.cam.2021.113656
Abstract
Sparse logistic regression, as an effective tool of classification, has been developed tremendously in recent two decades, from its origination the -regularized version to the sparsity constrained models. This paper is carried out on the sparsity constrained logistic regression by the Newton method. We begin with establishing its first-order optimality condition associated with a -stationary point. This point can be equivalently interpreted as a system of equations which is then efficiently solved by the Newton method. The method has a considerably low computational complexity and enjoys global and quadratic convergence properties. Numerical experiments on random and real data demonstrate its superior performance when against seven state-of-the-art solvers.
References in corpus (14)
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Rejoinder to "Least angle regression" by Efron et al
- A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems
- Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso
- Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization
- Subset Selection with Shrinkage: Sparse Linear Modeling when the SNR is low