pith. machine review for the scientific record. sign in

arxiv: 1805.11221 · v2 · submitted 2018-05-29 · 💻 cs.LG · stat.ML

Recognition: unknown

MBA: Mini-Batch AUC Optimization

Authors on Pith no claims yet
classification 💻 cs.LG stat.ML
keywords negativenumberpairspositiveproblemproposedalgorithmapproach
0
0 comments X
read the original abstract

Area under the receiver operating characteristics curve (AUC) is an important metric for a wide range of signal processing and machine learning problems, and scalable methods for optimizing AUC have recently been proposed. However, handling very large datasets remains an open challenge for this problem. This paper proposes a novel approach to AUC maximization, based on sampling mini-batches of positive/negative instance pairs and computing U-statistics to approximate a global risk minimization problem. The resulting algorithm is simple, fast, and learning-rate free. We show that the number of samples required for good performance is independent of the number of pairs available, which is a quadratic function of the positive and negative instances. Extensive experiments show the practical utility of the proposed method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.