Evolutionary Multitasking AUC Optimization [Research Frontier]

被引:8
作者
Chao, Wang [1 ]
Wu, Kai [1 ]
Liu, Jing [1 ]
机构
[1] Xidian Univ, Xian, Peoples R China
基金
中国国家自然科学基金;
关键词
Codes; Optimization methods; Receivers; Machine learning; Multitasking; Data structures; Proposals; Evolutionary computation; MULTIOBJECTIVE OPTIMIZATION; COMPUTATION; RANKING;
D O I
10.1109/MCI.2022.3155325
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:67 / 82
页数:16
相关论文
共 56 条
[1]  
[Anonymous], 2010, GECCO
[2]  
[Anonymous], 2013, 30 INT C MACH LEARN
[3]  
Bacardit J, 2004, LECT NOTES COMPUT SC, V3242, P1021
[4]  
Bacardit J., 2004, THESIS RAMON LLULL U
[5]   Cognizant Multitasking in Multiobjective Multifactorial Evolution: MO-MFEA-II [J].
Bali, Kavitesh Kumar ;
Gupta, Abhishek ;
Ong, Yew-Soon ;
Tan, Puay Siew .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (04) :1784-1796
[6]   Multifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II [J].
Bali, Kavitesh Kumar ;
Ong, Yew Soon ;
Gupta, Abhishek ;
Tan, Puay Siew .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) :69-83
[7]   An Adaptive Archive-Based Evolutionary Framework for Many-Task Optimization [J].
Chen, Yongliang ;
Zhong, Jinghui ;
Feng, Liang ;
Zhang, Jun .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2020, 4 (03) :369-384
[8]   Multi-objective evolutionary algorithm for optimizing the partial area under the ROC curve [J].
Cheng, Fan ;
Fu, Guanglong ;
Zhang, Xingyi ;
Qiu, Jianfeng .
KNOWLEDGE-BASED SYSTEMS, 2019, 170 :61-69
[9]   An adaptive mini-batch stochastic gradient method for AUC maximization [J].
Cheng, Fan ;
Zhang, Xia ;
Zhang, Chuang ;
Qiu, Jianfeng ;
Zhang, Lei .
NEUROCOMPUTING, 2018, 318 :137-150
[10]   Ranking and empirical minimization of U-statistics [J].
Clemencon, Stephan ;
Lugosi, Gabor ;
Vayatis, Nicolas .
ANNALS OF STATISTICS, 2008, 36 (02) :844-874