Abstract
Logistic regression has become a fundamental tool to facilitate data analysis and prediction in a variety of applications, including health care and social sciences. Depending on different sparsity assumptions, logistic regression models often incorporate various regularizations, including ℓ1-norm, ℓ2-norm and some non-convex regularizations. In this paper, we propose a nonconvex ℓ1-2-regularized logistic regression model assuming that the coefficients to be recovered are highly sparse. We derive two numerical algorithms with guaranteed convergence based on the alternating direction method of multipliers and the proximal operator of ℓ1-2. Numerical experiments on real data demonstrate the great potential of the proposed approach.
Original language | English |
---|---|
Title of host publication | Conference Record - 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019 |
Editors | Michael B. Matthews |
Pages | 779-783 |
Number of pages | 5 |
ISBN (Electronic) | 9781728143002 |
DOIs | |
State | Published - Nov 2019 |
Event | 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019 - Pacific Grove, United States Duration: Nov 3 2019 → Nov 6 2019 |
Publication series
Name | Conference Record - Asilomar Conference on Signals, Systems and Computers |
---|---|
Volume | 2019-November |
ISSN (Print) | 1058-6393 |
Conference
Conference | 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019 |
---|---|
Country/Territory | United States |
City | Pacific Grove |
Period | 11/3/19 → 11/6/19 |
Bibliographical note
Publisher Copyright:© 2019 IEEE.
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications