Journal article · 2025 · Open access
A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization
Complex & Intelligent Systems, 11(8) · Published 20 June 2025 · DOI 10.1007/s40747-025-01955-0
In brief
“A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization” is a 2025 journal article by Chaoyi Sun and 3 co-authors, published in Complex & Intelligent Systems. OpenAlex counts 2 citations as of 19 November 2026, which puts it in the top 6% of works published in 2025 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Complex & Intelligent Systems.
- Citations
- 2
- Most cited in
- 2026 (2)
- Field-weighted impact
- 0.86
- References
- 58
- Authors
- 4
Abstract
Surrogate-assisted evolutionary algorithms (SAEAs) commonly depend on traditional offspring generation methods such as simulated binary crossover and polynomial mutation, which often lead to suboptimal search efficiencies. This paper introduces the gradient-descent-like learning-based SAEA (GDL-SAEA) designed for expensive multiobjective optimization problems. Our method aims to determine the learned possibly fastest convergence (i.e., gradient-descent-like) direction for each solution via a trained neural network, leveraging prior knowledge from the relationships within the current population and surrogate model. The population is segmented into three subgroups, generating triple training data through cosine similarity and the Mahalanobis distance. Notably, each elite solution within these groups serves as a label for the corresponding poor solution with a midpoint acting as an anchor, thereby enhancing the supervised learning of the convergence process. To implement the proposed framework, three representative SAEAs are embedded into the GDL-SAEA. Experimental evaluations on multiobjective benchmarks and real-world problems with up to 10 objectives reveal that GDL-SAEA outperforms seven state-of-the-art and classic algorithms.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Sun, C., Zhang, B., Sun, H., & Feng, R. (2025). A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization. Complex & Intelligent Systems, 11(8). https://doi.org/10.1007/s40747-025-01955-0
MLA 9
Sun, Chaoyi, et al. “A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization.” Complex & Intelligent Systems, vol. 11, no. 8, 2025. https://doi.org/10.1007/s40747-025-01955-0.
Chicago
Sun, Chaoyi, Bo Zhang, Hai Sun, and Rui Feng. 2025. “A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization.” Complex & Intelligent Systems 11 (8). https://doi.org/10.1007/s40747-025-01955-0.
Harvard
Sun, C. et al. (2025) ‘A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization’, Complex & Intelligent Systems, 11(8). doi:10.1007/s40747-025-01955-0.
IEEE
C. Sun, B. Zhang, H. Sun, and R. Feng, “A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization,” Complex & Intelligent Systems, vol. 11, no. 8, 2025, doi: 10.1007/s40747-025-01955-0.
BibTeX
@article{sun2025gradient,
title = {{A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization}},
author = {Sun, Chaoyi and Zhang, Bo and Sun, Hai and Feng, Rui},
journal = {Complex \& Intelligent Systems},
year = {2025},
volume = {11},
number = {8},
doi = {10.1007/s40747-025-01955-0},
url = {https://doi.org/10.1007/s40747-025-01955-0}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- surrogate-assisted evolutionary algorithms
- cosine similarity
- Mahalanobis distance
- surrogate models
- many-objective optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Sun, C., Zhang, B., Sun, H., & Feng, R. (2025). A gradient-descent-like learning-based framework in surrogate-assisted evolutionary algorithms for expensive many-objective optimization. Complex & Intelligent Systems, 11(8). https://doi.org/10.1007/s40747-025-01955-0
How many times has this paper been cited?
2 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Complex & Intelligent Systems: sign in and open the PDF from this page.
Who wrote this paper?
Chaoyi Sun, Bo Zhang, Hai Sun, Rui Feng.
What is the DOI of this paper?
10.1007/s40747-025-01955-0, permanently at https://doi.org/10.1007/s40747-025-01955-0. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.