3 research outputs found
Algorithm Portfolio for Individual-based Surrogate-Assisted Evolutionary Algorithms
Surrogate-assisted evolutionary algorithms (SAEAs) are powerful optimisation
tools for computationally expensive problems (CEPs). However, a randomly
selected algorithm may fail in solving unknown problems due to no free lunch
theorems, and it will cause more computational resource if we re-run the
algorithm or try other algorithms to get a much solution, which is more serious
in CEPs. In this paper, we consider an algorithm portfolio for SAEAs to reduce
the risk of choosing an inappropriate algorithm for CEPs. We propose two
portfolio frameworks for very expensive problems in which the maximal number of
fitness evaluations is only 5 times of the problem's dimension. One framework
named Par-IBSAEA runs all algorithm candidates in parallel and a more
sophisticated framework named UCB-IBSAEA employs the Upper Confidence Bound
(UCB) policy from reinforcement learning to help select the most appropriate
algorithm at each iteration. An effective reward definition is proposed for the
UCB policy. We consider three state-of-the-art individual-based SAEAs on
different problems and compare them to the portfolios built from their
instances on several benchmark problems given limited computation budgets. Our
experimental studies demonstrate that our proposed portfolio frameworks
significantly outperform any single algorithm on the set of benchmark problems
Online model racing based on extreme performance
Racing algorithms are often used for offline model selection, where models are compared in terms of their average performance over a collection of problems. In this paper, we present a new racing algorithm variant, Max-Race, which makes decisions based on the maximum performance of models. It is an online algorithm, whose goal is to optimally allocate computational resources in a portfolio of evolutionary algorithms, while solving a particular problem instance. It employs a hypothesis test based on extreme value theory in order to decide, which component algorithms to retire, while avoiding unnecessary computations. Experimental results confirm that Max-Race is able to identify the best individual with high precision and low computational overhead. When used as a scheme to select the best from a portfolio of algorithms, the results compare favorably to the ones of other popular algorithm portfolio approaches. © 2014 is held by the owner/author(s)
Online Model Racing Based On Extreme Performance
Racing algorithms are often used for offline model selection, where models are compared in terms of their average performance over a collection of problems. In this paper, we present a new racing algorithm variant, Max-Race, which makes decisions based on the maximum performance of models. It is an online algorithm, whose goal is to optimally allocate computational resources in a portfolio of evolutionary algorithms, while solving a particular problem instance. It employs a hypothesis test based on extreme value theory in order to decide, which component algorithms to retire, while avoiding unnecessary computations. Experimental results confirm that Max-Race is able to identify the best individual with high precision and low computational overhead. When used as a scheme to select the best from a portfolio of algorithms, the results compare favorably to the ones of other popular algorithm portfolio approaches. © 2014 is held by the owner/author(s)