A Semi-Smooth Newton Algorithm for High-Dimensional Nonconvex Sparse Learning Article Swipe

MAKE IMPACT

Yueyong Shi , Jian Huang , Yuling Jiao , Qinglong Yang · YOU? · · 2018 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1802.08895

The smoothly clipped absolute deviation (SCAD) and the minimax concave penalty (MCP) penalized regression models are two important and widely used nonconvex sparse learning tools that can handle variable selection and parameter estimation simultaneously, and thus have potential applications in various fields such as mining biological data in high-throughput biomedical studies. Theoretically, these two models enjoy the oracle property even in the high-dimensional settings, where the number of predictors $p$ may be much larger than the number of observations $n$. However, numerically, it is quite challenging to develop fast and stable algorithms due to their non-convexity and non-smoothness. In this paper we develop a fast algorithm for SCAD and MCP penalized learning problems. First, we show that the global minimizers of both models are roots of the nonsmooth equations. Then, a semi-smooth Newton (SSN) algorithm is employed to solve the equations. We prove that the SSN algorithm converges locally and superlinearly to the Karush-Kuhn-Tucker (KKT) points. Computational complexity analysis shows that the cost of the SSN algorithm per iteration is $O(np)$. Combined with the warm-start technique, the SSN algorithm can be very efficient and accurate. Simulation studies and a real data example suggest that our SSN algorithm, with comparable solution accuracy with the coordinate descent (CD) and the difference of convex (DC) proximal Newton algorithms, is more computationally efficient.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1802.08895

PDF

https://arxiv.org/pdf/1802.08895

OA Status

green

Cited By

1

References

55

Related Works

10

OpenAlex ID

https://openalex.org/W2961610406

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2961610406

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1802.08895

Digital Object Identifier

Title

A Semi-Smooth Newton Algorithm for High-Dimensional Nonconvex Sparse Learning

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2018

Year of publication

Publication date

2018-02-24

Full publication date if available

Authors

Yueyong Shi, Jian Huang, Yuling Jiao, Qinglong Yang

List of authors in order

Landing page

https://arxiv.org/abs/1802.08895

Publisher landing page

PDF URL

https://arxiv.org/pdf/1802.08895

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1802.08895

Direct OA link when available

Concepts

Coordinate descent, Karush–Kuhn–Tucker conditions, Smoothness, Algorithm, Mathematics, Minimax, Convexity, Convergence (economics), Mathematical optimization, Scad, Newton's method, Regular polygon, Feature selection, Computer science, Applied mathematics, Nonlinear system, Artificial intelligence, Mathematical analysis, Economics, Financial economics, Quantum mechanics, Physics, Psychiatry, Myocardial infarction, Economic growth, Geometry, Psychology

Top concepts (fields/topics) attached by OpenAlex

Cited by

1

Total citation count in OpenAlex

Citations by year (recent)

2020: 1

Per-year citation counts (last 5 years)

References (count)

55

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload