Abstract
Much of the literature found on surrogate models presents
new approaches or algorithms trying to solve black-box optimization
problems with as little evaluations as possible. The comparisons of these
new ideas with other algorithms are often very limited and constrained to
non-surrogate algorithms or algorithms following very similar ideas as the
presented ones. This work aims to provide both an overview over the most
important general trends in surrogate assisted optimization and a more
wide spanning comparison in a fair environment by reimplementation
within the same software framework.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science |
Number of pages | 8 |
Publication status | Published - 2017 |
Fields of science
- 102 Computer Sciences
- 102001 Artificial intelligence
- 102011 Formal languages
- 102022 Software development
- 102031 Theoretical computer science
- 603109 Logic
- 202006 Computer hardware
JKU Focus areas
- Computation in Informatics and Mathematics