Human Assisted Learning by Evolutionary Multi-Objective Optimization

被引:0
|
作者
Liu, Dan-Xuan [1 ]
Mu, Xin [2 ]
Qian, Chao [1 ]
机构
[1] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210023, Peoples R China
[2] Peng Cheng Lab, Shenzhen 518000, Peoples R China
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Machine learning models have liberated manpower greatly in many real-world tasks, but their predictions are still worse than humans on some specific instances. To improve the performance, it is natural to optimize machine learning models to take decisions for most instances while delivering a few tricky instances to humans, resulting in the problem of Human Assisted Learning (HAL). Previous works mainly formulated HAL as a constrained optimization problem that tries to find a limited subset of instances for human decision such that the sum of model and human errors can be minimized; and employed the greedy algorithms, whose performance, however, may be limited due to the greedy nature. In this paper, we propose a new framework HAL-EMO based on Evolutionary Multi-objective Optimization, which reformulates HAL as a bi-objective optimization problem that minimizes the number of selected instances for human decision and the total errors simultaneously, and employs a Multi-Objective Evolutionary Algorithm (MOEA) to solve it. We implement HALEMO using two MOEAs, the popular NSGA-II as well as the theoretically grounded GSEMO. We also propose a specific MOEA, called BSEMO, with biased selection and balanced mutation for HAL-EMO, and prove that for human assisted regression and classification, HAL-EMO using BSEMO can achieve better and same theoretical guarantees than previous greedy algorithms, respectively. Experiments on the tasks of medical diagnosis and content moderation show the superiority of HAL-EMO (with either NSGA-II, GSEMO or BSEMO) over previous algorithms, and that using BSEMO leads to the best performance of HAL-EMO.
引用
收藏
页码:12453 / 12461
页数:9
相关论文
共 50 条
  • [1] Machine Learning Assisted Evolutionary Multi-Objective Optimization
    Zhang, Xingyi
    Cheng, Ran
    Feng, Liang
    Jin, Yaochu
    [J]. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2023, 18 (02) : 16 - 17
  • [2] Evolutionary Multi-Objective Optimization
    Deb, Kalyanmoy
    [J]. GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2010, : 2577 - 2602
  • [3] Evolutionary multi-objective optimization
    Coello Coello, Carlos A.
    Hernandez Aguirre, Arturo
    Zitzler, Eckart
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) : 1617 - 1619
  • [4] Using Machine Learning to Improve Evolutionary Multi-Objective Optimization
    Alotaibi, Rakan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2022, 22 (06): : 203 - 211
  • [5] Adaptive population structure learning in evolutionary multi-objective optimization
    Wang, Shuai
    Zhang, Hu
    Zhang, Yi
    Zhou, Aimin
    [J]. SOFT COMPUTING, 2020, 24 (13) : 10025 - 10042
  • [6] Solution Representation Learning in Multi-Objective Transfer Evolutionary Optimization
    Lim, Ray
    Zhou, Lei
    Gupta, Abhishek
    Ong, Yew-Soon
    Zhang, Allan N.
    [J]. IEEE ACCESS, 2021, 9 : 41844 - 41860
  • [7] Adaptive population structure learning in evolutionary multi-objective optimization
    Shuai Wang
    Hu Zhang
    Yi Zhang
    Aimin Zhou
    [J]. Soft Computing, 2020, 24 : 10025 - 10042
  • [8] Hyper multi-objective evolutionary algorithm for multi-objective optimization problems
    Guo, Weian
    Chen, Ming
    Wang, Lei
    Wu, Qidi
    [J]. SOFT COMPUTING, 2017, 21 (20) : 5883 - 5891
  • [9] Multi-Objective Factored Evolutionary Optimization and the Multi-Objective Knapsack Problem
    Peerlinck, Amy
    Sheppard, John
    [J]. 2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [10] Hyper multi-objective evolutionary algorithm for multi-objective optimization problems
    Weian Guo
    Ming Chen
    Lei Wang
    Qidi Wu
    [J]. Soft Computing, 2017, 21 : 5883 - 5891