The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Accelerating Evolutionary Algorithms With Gaussian Process Fitness Function Models
Abstract
We present an overview of evolutionary algorithms that use empirical models of the fitness function to accelerate convergence, distinguishing between evolution control and the surrogate approach. We describe the Gaussian process model and propose using it as an inexpensive fitness function surrogate. Implementation issues such as efficient and numerically stable computation, exploration versus exploitation, local modeling, multiple objectives and constraints, and failed evaluations are addressed. Our resulting Gaussian process optimization procedure clearly outperforms other evolutionary strategies on standard test functions as well as on a real-world problem: the optimization of stationary gas turbine compressor profiles.
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
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
Self-citationEvolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Schwefel, H. (1995) · Cited by 2,203
Numerical optimization of computer models
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90117-3 · Cited by 1,624
Minimax and maximin distance designs
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(90)90122-b · Cited by 1,451 · cited 1×
“One possible density measure is the maximin distance [28], i.”
BackgroundA rigorous framework for optimization of expensive functions by surrogates
Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1999) · Structural Optimization · doi:10.1007/bf01197708 · Cited by 960
Cited by
Surrogate-assisted evolutionary computation: Recent advances and future challenges
Jin, Y. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.001 · Cited by 1,514
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
Emmerich, M. T. M., Giannakoglou, K. C., & Naujoks, B. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859463 · Cited by 759
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033671 · Cited by 746
Data-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686
Combining Global and Local Surrogate Models to Accelerate Evolutionary Optimization
Zhou, Z., Ong, Y. S., Nair, P. B., Keane, A. J., & Lum, K. Y. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2005.855506 · Cited by 429
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Liu, B., Aliakbarian, H., Ma, Z., Vandenbosch, G. A. E., Gielen, G., & Excell, P. (2014) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2013.2283605 · Cited by 327
Surrogate-assisted hierarchical particle swarm optimization
Yu, H., Tan, Y., Zeng, J., Sun, C., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.04.062 · Cited by 313
Tapia, G., Khairallah, S., Matthews, M., King, W. E., & Elwany, A. (2018) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-017-1045-z · Cited by 284
Offline Data-Driven Evolutionary Optimization Using Selective Surrogate Ensembles
Wang, H., Jin, Y., Sun, C., & Doherty, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2834881 · Cited by 262
Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System
Wang, H., Jin, Y., & Jansen, J. O. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2555315 · Cited by 261
Metadata
- Authors
- Buche, D., Schraudolph, N. N., & Koumoutsakos, P.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Published
- 2005-05
- Volume
- 35
- Issue
- 2
- Pages
- 183-194
- ISSN
- 1094-6977 (ISSN-L)
- OpenAlex
- W2110194546
- Cited by
- 335
- References
- 22
- FWCI
- 13.74
- 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.