1 code implementation • 30 Jul 2022 • Lennart Schneider, Lennart Schäpermeier, Raphael Patrick Prager, Bernd Bischl, Heike Trautmann, Pascal Kerschke
We identify a subset of BBOB problems that are close to the HPO problems in ELA feature space and show that optimizer performance is comparably similar on these two sets of benchmark problems.
1 code implementation • 22 Apr 2022 • Lennart Schäpermeier, Christian Grimme, Pascal Kerschke
It is able to efficiently model and exploit LE sets in MMMOO problems.
1 code implementation • 29 Nov 2020 • Lennart Schäpermeier, Christian Grimme, Pascal Kerschke
Simultaneously visualizing the decision and objective space of continuous multi-objective optimization problems (MOPs) recently provided key contributions in understanding the structure of their landscapes.
1 code implementation • 20 Jun 2020 • Lennart Schäpermeier, Christian Grimme, Pascal Kerschke
Therefore, we build on the GFH approach but apply a new technique for approximating the location of locally efficient points and using the divergence of the multi-objective gradient vector field as a robust second-order condition.