L1-penalized AUC-optimization with a surrogate loss

The area under the ROC curve (AUC) is one of the most common criteria used to measure the overall performance of binary classifiers for a wide range of machine learning problems. In this article, we propose a L-1 -penalized AUC-optimization classifier that directly maximizes the AUC for high -dimensional data. Toward this, we employ the AUC-consistent surrogate loss function and combine the L-1 -norm penalty which enables us to estimate coefficients and select informative variables simultaneously. In addition, we develop an efficient optimization algorithm by adopting k -means clustering and proximal gradient descent which enjoys computational advantages to obtain solutions for the proposed method. Numerical simulation studies demonstrate that the proposed method shows promising performance in terms of prediction accuracy, variable selectivity, and computational costs.