mlsanityData to 13 Oct 2026

MBA: Mini-Batch AUC Optimization

arXiv 1805.11221 ↗First posted 29 May 2018cs.LG stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). First posted on arXiv 29 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1; 2025: 1.

7 papers.