Stochastic Proximal AUC Maximization

06/14/2019
by   Yunwen Lei, et al.
0

In this paper we consider the problem of maximizing the Area under the ROC curve (AUC) which is a widely used performance metric in imbalanced classification and anomaly detection. Due to the pairwise nonlinearity of the objective function, classical SGD algorithms do not apply to the task of AUC maximization. We propose a novel stochastic proximal algorithm for AUC maximization which is scalable to large scale streaming data. Our algorithm can accommodate general penalty terms and is easy to implement with favorable O(d) space and per-iteration time complexities. We establish a high-probability convergence rate O(1/√(T)) for the general convex setting, and improve it to a fast convergence rate O(1/T) for the cases of strongly convex regularizers and no regularization term (without strong convexity). Our proof does not need the uniform boundedness assumption on the loss function or the iterates which is more fidelity to the practice. Finally, we perform extensive experiments over various benchmark data sets from real-world application domains which show the superior performance of our algorithm over the existing AUC maximization algorithms.

READ FULL TEXT
research
11/04/2020

Stochastic Hard Thresholding Algorithms for AUC Maximization

In this paper, we aim to develop stochastic hard thresholding algorithms...
research
11/08/2019

Variance Reduced Stochastic Proximal Algorithm for AUC Maximization

Stochastic Gradient Descent has been widely studied with classification ...
research
07/08/2022

Balanced Self-Paced Learning for AUC Maximization

Learning to improve AUC performance is an important topic in machine lea...
research
02/18/2020

A Distributionally Robust Area Under Curve Maximization Model

Area under ROC curve (AUC) is a widely used performance measure for clas...
research
09/23/2020

Online AUC Optimization for Sparse High-Dimensional Datasets

The Area Under the ROC Curve (AUC) is a widely used performance measure ...
research
02/25/2015

Online Pairwise Learning Algorithms with Kernels

Pairwise learning usually refers to a learning task which involves a los...
research
01/05/2022

Convergence and Complexity of Stochastic Block Majorization-Minimization

Stochastic majorization-minimization (SMM) is an online extension of the...

Please sign up or login with your details

Forgot password? Click here to reset