Preprint · 2023 · Open access

Experience-Based Evolutionary Algorithms for Expensive Optimization

Xunzhao Yu, Yan Wang, Ling Zhu, Dimitar Filev, Xin Yao

arXiv (Cornell University) · Published 9 April 2023 · DOI 10.48550/arxiv.2304.04166

Open PDFView at the publisherCite this paper

In brief

“Experience-Based Evolutionary Algorithms for Expensive Optimization” is a 2023 preprint by Xunzhao Yu and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 7 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
7
Most cited in
2026 (4)
References
35
Authors
5

Abstract

Optimization algorithms are very different from human optimizers. A human being would gain more experiences through problem-solving, which helps her/him in solving a new unseen problem. Yet an optimization algorithm never gains any experiences by solving more problems. In recent years, efforts have been made towards endowing optimization algorithms with some abilities of experience learning, which is regarded as experience-based optimization. In this paper, we argue that hard optimization problems could be tackled efficiently by making better use of experiences gained in related problems. We demonstrate our ideas in the context of expensive optimization, where we aim to find a near-optimal solution to an expensive optimization problem with as few fitness evaluations as possible. To achieve this, we propose an experience-based surrogate-assisted evolutionary algorithm (SAEA) framework to enhance the optimization efficiency of expensive problems, where experiences are gained across related expensive tasks via a novel meta-learning method. These experiences serve as the task-independent parameters of a deep kernel learning surrogate, then the solutions sampled from the target task are used to adapt task-specific parameters for the surrogate. With the help of experience learning, competitive regression-based surrogates can be initialized using only 1$d$ solutions from the target task ($d$ is the dimension of the decision space). Our experimental results on expensive multi-objective and constrained optimization problems demonstrate that experiences gained from related tasks are beneficial for the saving of evaluation budgets on the target problem.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Yu, X., Wang, Y., Zhu, L., Filev, D., & Yao, X. (2023). Experience-Based Evolutionary Algorithms for Expensive Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2304.04166

MLA 9

Yu, Xunzhao, et al. “Experience-Based Evolutionary Algorithms for Expensive Optimization.” arXiv (Cornell University), 2023. https://doi.org/10.48550/arxiv.2304.04166.

Chicago

Yu, Xunzhao, Yan Wang, Ling Zhu, Dimitar Filev, and Xin Yao. 2023. “Experience-Based Evolutionary Algorithms for Expensive Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2304.04166.

Harvard

Yu, X. et al. (2023) ‘Experience-Based Evolutionary Algorithms for Expensive Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2304.04166.

IEEE

X. Yu, Y. Wang, L. Zhu, D. Filev, and X. Yao, “Experience-Based Evolutionary Algorithms for Expensive Optimization,” arXiv (Cornell University), 2023, doi: 10.48550/arxiv.2304.04166.

BibTeX

@misc{yu2023experience,
  title     = {{Experience-Based Evolutionary Algorithms for Expensive Optimization}},
  author    = {Yu, Xunzhao and Wang, Yan and Zhu, Ling and Filev, Dimitar and Yao, Xin},
  howpublished = {arXiv (Cornell University)},
  year      = {2023},
  doi       = {10.48550/arxiv.2304.04166},
  url       = {https://doi.org/10.48550/arxiv.2304.04166}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202422
202511
202644

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • expensive optimization
  • surrogate-assisted evolutionary algorithms
  • meta-learning
  • deep kernel learning
  • multi-objective optimization
  • constrained optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Yu, X., Wang, Y., Zhu, L., Filev, D., & Yao, X. (2023). Experience-Based Evolutionary Algorithms for Expensive Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2304.04166

How many times has this paper been cited?

7 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 arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Xunzhao Yu, Yan Wang, Ling Zhu, Dimitar Filev, Xin Yao.

What is the DOI of this paper?

10.48550/arxiv.2304.04166, permanently at https://doi.org/10.48550/arxiv.2304.04166. 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.