mlsanityData to 14 Oct 2026

Evolutionary Multitasking AUC Optimization

arXiv 2201.01145 ↗First posted 4 Jan 2022cs.LG cs.NEcited by 1

Not on the map. Why?

Abstract (arXiv)

Learning to optimize the area under the receiver operating characteristics curve (AUC) performance for imbalanced data has attracted much attention in recent years. Although there have been several methods of AUC optimization, scaling up AUC optimization is still an open issue due to its pairwise learning style. Maximizing AUC in the large-scale dataset can be considered as a non-convex and expensive problem. Inspired by the characteristic of pairwise learning, the cheap AUC optimization task with a small-scale dataset sampled from the large-scale dataset is constructed to promote the AUC accuracy of the original, large-scale, and expensive AUC optimization task. This paper develops an evolutionary multitasking framework (termed EMTAUC) to make full use of information among the constructed cheap and expensive tasks to obtain higher performance. In EMTAUC, one mission is to optimize AUC from the sampled dataset, and the other is to maximize AUC from the original dataset. Moreover, due to the cheap task containing limited knowledge, a strategy for dynamically adjusting the data structure of inexpensive tasks is proposed to introduce more knowledge into the multitasking AUC optimization environment. The performance of the proposed method is evaluated on a series of binary classification datasets. The experimental results demonstrate that EMTAUC is highly competitive to single task methods and online methods. Supplementary materials and source code implementation of EMTAUC can be accessed at https://github.com/xiaofangxd/EMTAUC.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 58 references that are in the map. First posted on arXiv 4 Jan 2022.

Builds on

6 of 58 references.

References · 6

  1. 2016The CMA Evolution Strategy: A Tutorialcited by 377
  2. 2013One-Pass AUC Optimizationcited by 42
  3. 2013On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functionscited by 23
  4. 2016Transfer Learning based Dynamic Multiobjective Optimization Algorithmscited by 17
  5. 2018MBA: Mini-Batch AUC Optimizationcited by 7
  6. 2014Multiobjective Optimization of Classifiers by Means of 3-D Convex Hull Based Evolutionary Algorithmcited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.