One-Pass AUC Optimization
Preprint
Abstract
AUC is an important performance measure and many algorithms have been devoted to AUC optimization, mostly by minimizing a surrogate convex loss on a training data set. In this work, we focus on one-pass AUC optimization that requires only going through the training data once without storing the entire training dataset, where conventional online learning algorithms cannot be applied directly because AUC is measured by a sum of losses defined over pairs of instances from different classes. We develop a regression-based algorithm which only needs to maintain the first and second order statistics of training data in memory, resulting a storage requirement independent from the size of training data. To efficiently handle high dimensional data, we develop a randomized algorithm that approximates the covariance matrices by low rank matrices. We verify, both theoretically and empirically, the effectiveness of the proposed algorithm.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Tail Bounds for All Eigenvalues of a Sum of Random Matrices2011
- Exploratory Undersampling for Class-Imbalance LearningIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2008
- Prediction, Learning, and Games2006
- Rank-Deficient and Discrete III-Posed Problems: Numerical Aspects of Linear InversionJournal of the American Statistical Association, 1999
- A method of comparing the areas under receiver operating characteristic curves derived from the same cases.Radiology, 1983
- Basic principles of ROC analysisSeminars in Nuclear Medicine, 1978