An Efficient ADMM-Based Algorithm to Nonconvex Penalized Support Vector Machines
원문 초록
Support vector machines (SVMs) with sparsity-inducing nonconvex penalties have received considerable attentions for the characteristics of automatic classification and variable selection. However, it is quite challenging to solve the nonconvex penalized SVMs due to their nondifferentiability, nonsmoothness and nonconvexity. In this paper, we propose an efficient ADMM-based algorithm to the nonconvex penalized SVMs. The proposed algorithm covers a large class of commonly used nonconvex regularization terms including the smooth clipped absolute deviation (SCAD) penalty, minimax concave penalty (MCP), log-sum penalty (LSP) and capped-$\ell_1$ penalty. The computational complexity analysis shows that the proposed algorithm enjoys low computational cost. Moreover, the convergence of the proposed algorithm is guaranteed. Extensive experimental evaluations on five benchmark datasets demonstrate the superior performance of the proposed algorithm to other three state-of-the-art approaches.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Handling bounded response in high dimensions: a Horseshoe prior Bayesian Beta regression approach
Stability Selection via Variable Decorrelation
High Dimensional Bayesian Optimization using Lasso Variable Selection
Causal Feature Learning in the Social Sciences
Bayesian Cox model with graph-structured variable selection priors for multi-omics biomarker identification
AirCast: Improving Air Pollution Forecasting Through Multi-Variable Data Alignment
토론
이 논문과 연결된 포럼 글이 아직 없습니다.