Online Black-Box Algorithm Portfolios for Continuous Optimization

Petr Baudiš and Petr Pošík

Abstract. In black-box function optimization, we can choose from a wide variety of heuristic algorithms that are suited to different functions and computation budgets. Given a particular function to be optimized, the problem we consider in this paper is how to select the appropriate algorithm. In general, this problem is studied in the field of algorithm portfolios; we treat the algorithms as black boxes themselves and consider online selection (without learning mapping from problem features to best algorithms a priori and dynamically switching between algorithms during the optimization run).

We study some approaches to algorithm selection and present two original selection strategies based on the UCB1 multi-armed bandit policy applied to unbounded rewards. We benchmark our strategies on the BBOB workshop reference functions and demonstrate that algorithm portfolios are beneficial in practice even with some fairly simple strategies, though choosing a good strategy is important.

LNCS 8672, p. 40 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer International Publishing Switzerland 2014