Multitask Evolution Strategy With Knowledge-Guided External Sampling

被引:6
作者
Li, Yanchi [1 ]
Gong, Wenyin [1 ]
Li, Shuijia [1 ]
机构
[1] China Univ Geosci, Sch Comp Sci, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Knowledge transfer; Task analysis; Optimization; Convergence; Statistics; Sociology; Shape; Evolution strategy (ES); evolutionary multitasking; external sampling; knowledge transfer; multitask optimization;
D O I
10.1109/TEVC.2023.3330265
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary multitask optimization employs similarities among tasks via evolutionary algorithms (EAs) with knowledge transfer techniques to address multiple optimization tasks simultaneously. Although existing knowledge transfer techniques achieved success on population-based EAs, they are inappropriate for evolution strategies (ESs) that employ probability distribution sampling. These techniques will face two difficulties when applied to ESs: 1) distribution adaptation errors and 2) convergence difficulties. This article proposes a knowledge-guided external sampling (KGxS) method to provide effective knowledge transfer in multitask ESs (MTESs) for solving multitask optimization problems (MTOPs). KGxS guides the distribution evolution in the target task by transferring solutions from source tasks as external samples. Since these external samples are close to the target distribution, they can handle the difficulty of distribution adaptation errors. In addition, the convergence difficulty caused by negative knowledge transfer is also handled through a mitigation strategy, which adaptively controls the number of external samples. Besides, the external samples carry two kinds of knowledge: 1) domain knowledge which employs the similarity of the optimal domains among tasks and 2) shape knowledge that utilizes the function shapes similarity among tasks. Furthermore, a general boundary constraint handling technique is proposed for ESs to adapt to unconstrained and constrained optimization environments. Empirical results show that KGxS can significantly enhance the positive transfer effect on different types of ES on MTOPs. Moreover, the proposed method obtained superior performance over 20 state-of-the-art algorithms on 38 benchmark problems and three types of real-world applications, including multitask, many-task, and constrained multitask optimization.
引用
收藏
页码:1733 / 1745
页数:13
相关论文
共 55 条
[1]  
Arbel M., 2020, P NT C LEARN REPR, P1
[2]   From Multitask Gradient Descent to Gradient-Free Evolutionary Multitasking: A Proof of Faster Convergence [J].
Bai, Lu ;
Lin, Wu ;
Gupta, Abhishek ;
Ong, Yew-Soon .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (08) :8561-8573
[3]   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
[4]   Handling bound constraints in CMA-ES: An experimental study [J].
Biedrzycki, Rafal .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 52
[5]   Evolutionary Multitasking AUC Optimization [Research Frontier] [J].
Chao, Wang ;
Wu, Kai ;
Liu, Jing .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2022, 17 (02) :67-82
[6]   Evolutionary Multitasking for Feature Selection in High-Dimensional Classification via Particle Swarm Optimization [J].
Chen, Ke ;
Xue, Bing ;
Zhang, Mengjie ;
Zhou, Fengyu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (03) :446-460
[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]   Model-based evolutionary algorithms: a short survey [J].
Cheng, Ran ;
He, Cheng ;
Jin, Yaochu ;
Yao, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2018, 4 (04) :283-292
[9]  
Da B, 2017, Arxiv, DOI [arXiv:1706.03470, DOI 10.48550/ARXIV.1706.03470]
[10]  
Feng L., 2020, P IEEE WORLD C COMP, P1