AUC Maximization in the Era of Big Data and AI: A Survey

• URL: http://arxiv.org/abs/2203.15046v1
• Date: Mon, 28 Mar 2022 19:24:05 GMT
• Title: AUC Maximization in the Era of Big Data and AI: A Survey
• Authors: Tianbao Yang, Yiming Ying
• Abstract summary: Area under ROC curve, a.k.a. AUC, is a measure of choice for assessing performance of a ford data imbalance. AUC refers to a learning paradigm that learns a predictive model by directly maximizing its AUC score.
• Score: 64.50025542570235
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Area under the ROC curve, a.k.a. AUC, is a measure of choice for assessing the performance of a classifier for imbalanced data. AUC maximization refers to a learning paradigm that learns a predictive model by directly maximizing its AUC score. It has been studied for more than two decades dating back to late 90s and a huge amount of work has been devoted to AUC maximization since then. Recently, stochastic AUC maximization for big data and deep AUC maximization for deep learning have received increasing attention and yielded dramatic impact for solving real-world problems. However, to the best our knowledge there is no comprehensive survey of related works for AUC maximization. This paper aims to address the gap by reviewing the literature in the past two decades. We not only give a holistic view of the literature but also present detailed explanations and comparisons of different papers from formulations to algorithms and theoretical guarantees. We also identify and discuss remaining and emerging issues for deep AUC maximization, and provide suggestions on topics for future work.

Related papers

• AUC Optimization from Multiple Unlabeled Datasets [14.318887072787938]
  We propose U$m$-AUC, an AUC optimization approach that converts the U$m$ data into a multi-label AUC optimization problem. We show that the proposed U$m$-AUC is effective theoretically and empirically.
  arXiv  Detail & Related papers  (2023-05-25T06:43:42Z)
• Weakly Supervised AUC Optimization: A Unified Partial AUC Approach [53.59993683627623]
  We present WSAUC, a unified framework for weakly supervised AUC optimization problems. We first frame the AUC optimization problems in various weakly supervised scenarios as a common formulation of minimizing the AUC risk on contaminated sets. We then introduce a new type of partial AUC, specifically, the reversed partial AUC (rpAUC), which serves as a robust training objective for AUC in the presence of contaminated labels.
  arXiv  Detail & Related papers  (2023-05-23T17:11:33Z)
• Federated Compositional Deep AUC Maximization [58.25078060952361]
  We develop a novel federated learning method for imbalanced data by directly optimizing the area under curve (AUC) score. To the best of our knowledge, this is the first work to achieve such favorable theoretical results.
  arXiv  Detail & Related papers  (2023-04-20T05:49:41Z)
• Balanced Self-Paced Learning for AUC Maximization [88.53174245457268]
  Existing self-paced methods are limited to pointwise AUC. Our algorithm converges to a stationary point on the basis of closed-form solutions.
  arXiv  Detail & Related papers  (2022-07-08T02:09:32Z)
• Evolutionary Multitasking AUC Optimization [10.279426529746667]
  This paper develops an evolutionary (termed EMT) to make full use of information among the constructed cheap and expensive tasks to obtain higher performance. The performance of the proposed method is evaluated on binary classification datasets.
  arXiv  Detail & Related papers  (2022-01-04T14:14:13Z)
• Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification [63.44396343014749]
  We propose a new margin-based surrogate loss function for the AUC score. It is more robust than the commonly used. square loss while enjoying the same advantage in terms of large-scale optimization. To the best of our knowledge, this is the first work that makes DAM succeed on large-scale medical image datasets.
  arXiv  Detail & Related papers  (2020-12-06T03:41:51Z)
• Stochastic Hard Thresholding Algorithms for AUC Maximization [49.00683387735522]
  We develop a hard thresholding algorithm for AUC in distributiond classification. We conduct experiments to show the efficiency and effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2020-11-04T16:49:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.