Zobrazeno 1 - 10
of 296
pro vyhledávání: '"Doerr, Carola"'
Autor:
Santoni, Maria Laura, Raponi, Elena, Neumann, Aneta, Neumann, Frank, Preuss, Mike, Doerr, Carola
In real-world applications, users often favor structurally diverse design choices over one high-quality solution. It is hence important to consider more solutions that decision-makers can compare and further explore based on additional criteria. Alon
Externí odkaz:
http://arxiv.org/abs/2408.16393
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Following a century of research on the topic, it is still unclear how low the
Externí odkaz:
http://arxiv.org/abs/2407.11533
Exploratory landscape analysis (ELA) is a well-established tool to characterize optimization problems via numerical features. ELA is used for problem comprehension, algorithm design, and applications such as automated algorithm selection and configur
Externí odkaz:
http://arxiv.org/abs/2407.07439
Autor:
Cenikj, Gjorgjina, Nikolikj, Ana, Petelin, Gašper, van Stein, Niki, Doerr, Carola, Eftimov, Tome
The selection of the most appropriate algorithm to solve a given problem instance, known as algorithm selection, is driven by the potential to capitalize on the complementary performance of different algorithms across sets of problem instances. Howev
Externí odkaz:
http://arxiv.org/abs/2406.06629
This study examines the generalization ability of algorithm performance prediction models across various benchmark suites. Comparing the statistical similarity between the problem collections with the accuracy of performance prediction models that ar
Externí odkaz:
http://arxiv.org/abs/2405.12259
This study explores the influence of modules on the performance of modular optimization frameworks for continuous single-objective black-box optimization. There is an extensive variety of modules to choose from when designing algorithm variants, howe
Externí odkaz:
http://arxiv.org/abs/2405.11964
Optimization problems in dynamic environments have recently been the source of several theoretical studies. One of these problems is the monotonic Dynamic Binary Value problem, which theoretically has high discriminatory power between different Genet
Externí odkaz:
http://arxiv.org/abs/2404.15837
The recently proposed MA-BBOB function generator provides a way to create numerical black-box benchmark problems based on the well-established BBOB suite. Initial studies on this generator highlighted its ability to smoothly transition between the co
Externí odkaz:
http://arxiv.org/abs/2404.07539
Publikováno v:
IEEE Transactions on Evolutionary Computation (2024)
A widely accepted way to assess the performance of iterative black-box optimizers is to analyze their empirical cumulative distribution function (ECDF) of pre-defined quality targets achieved not later than a given runtime. In this work, we consider
Externí odkaz:
http://arxiv.org/abs/2404.02031
The number of proposed iterative optimization heuristics is growing steadily, and with this growth, there have been many points of discussion within the wider community. One particular criticism that is raised towards many new algorithms is their foc
Externí odkaz:
http://arxiv.org/abs/2402.09800