Knee Point-Based Imbalanced Transfer Learning for Dynamic Multiobjective Optimization
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
Dynamic multiobjective optimization problems (DMOPs) are optimization problems with multiple conflicting optimization objectives, and these objectives change over time. Transfer learning-based approaches have been proven to be promising; however, a slow solving speed is one of the main obstacles preventing such methods from solving real-world problems. One of the reasons for the slow running speed is that low-quality individuals occupy a large amount of computing resources, and these individuals may lead to negative transfer. Combining high-quality individuals, such as knee points, with transfer learning is a feasible solution to this problem. However, the problem with this idea is that the number of high-quality individuals is often very small, so it is difficult to acquire substantial improvements using conventional transfer learning methods. In this article, we propose a knee point-based transfer learning method, called KT-DMOEA, for solving DMOPs. In the proposed method, a trend prediction model (TPM) is developed for producing the estimated knee points. Then, an imbalance transfer learning method is proposed to generate a high-quality initial population by using these estimated knee points. The advantage of this approach is that the seamless integration of a small number of high-quality individuals and the imbalance transfer learning technique can greatly improve the computational efficiency while maintaining the quality of the solution. The experimental results and performance comparisons with some chosen state-of-the-art algorithms demonstrate that the proposed design is capable of significantly improving the performance of dynamic optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918 · cited 1×
“The parameters in SVM are set by default [45].”
BackgroundPan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387 · cited 1×
“…running speed is that the existing methods do not carefully select individuals during the environmental selection process, which not only results in a large amount of computing resources being wasted on low-quality individuals but also greatly increases the possibility of negative transfer [12].”
BackgroundMOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069 · cited 2×
“…compared against several popular algorithms, including MOEA/D-SVR [39], Tr-DMOEA [9], MOEA/D-KF [30], PPS [28], and the baseline algorithm MOEA/D [40], which is modified as RI-MOEA/D to Generate randomly dominated solutions P t ; 13 For a fair comparison, the baseline algorithm in all compared…”
MethodMultiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798 · cited 2×
“Compared with the IGD metric, the HV index [14] can better quantify the convergence and diversity of the solutions obtained by the algorithms, and the experimental results show that the proposed algorithm has advantages over the other methods in most cases.”
BackgroundDerrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512 · cited 1×
“At the bottom of these two tables, “ + ,” “ = ,” and “ − ” indicate that the KT-MOEA/D is statistically significantly better, indifferent or worse than the compared algorithms, respectively, according to the Wilcoxon test [46] (both are at the 5% significance level).”
ResultLearning from imbalanced data: open challenges and future directions
Krawczyk, B. (2016) · Progress in Artificial Intelligence · doi:10.1007/s13748-016-0094-0 · Cited by 2,459 · cited 1×
“However, compared with other types of solutions, such as nondominated solutions and dominated solutions, the number of knee points is very low, so this problem is considered a typical imbalanced learning problem [38].”
BackgroundBoosting for transfer learning
Dai, W., Yang, Q., Xue, G.-R., & Yu, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273521 · Cited by 1,724 · cited 1×
“Therefore, we propose to use a transfer learning technique, so called TrAdaboost [37], to improve the prediction accuracy.”
MethodA faster algorithm for calculating hypervolume
While, L., Hingston, P., Barone, L., & Huband, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851275 · Cited by 1,100 · cited 1×
“2) The HV [44] is used to quantify the convergence and distribution of solutions obtained by the algorithm.”
MethodA Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867 · cited 3×
“A remarkable advantage of knee points showed that these individuals possess higher hypervolume (HV) values according to [13].”
BackgroundResultRM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Zhang, Q., Zhou, A., & Jin, Y. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894202 · Cited by 827
Cited by
Evolutionary Transfer Optimization - A New Frontier in Evolutionary Computation Research
Tan, K. C., Feng, L., & Jiang, M. (2021) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2020.3039066 · Cited by 315
Self-citationA Meta-Knowledge Transfer-Based Differential Evolution for Multitask Optimization
Li, J.-Y., Zhan, Z.-H., Tan, K. C., & Zhang, J. (2022) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3131236 · Cited by 185
Metadata
- Authors
- Jiang, M., Wang, Z., Hong, H., & Yen, G. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2021-02
- Volume
- 25
- Issue
- 1
- Pages
- 117-129
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3037258640
- Cited by
- 237
- References
- 38
- FWCI
- 13.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.