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.