Features for Exploiting Black-Box Optimization Problem Structure.

Abell T, Malitsky Y, Tierney K. Features for Exploiting Black-Box Optimization Problem Structure. In: Nicosia G, Pardalos P, eds. Learning and Intelligent Optimization: 7th International Conference, LION 7, Catania, Italy, January 7-11, 2013, Revised Selected Papers. Lecture Notes in Computer Science. Vol 7997. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013: 30-36.Black-box optimization (BBO) problems arise in numerous scientific and engineering applications and are characterized by computationally intensive objective functions, which severely limit the number of evaluations that can be performed. We present a robust set of features that analyze the fitness landscape of BBO problems and show how an algorithm portfolio approach can exploit these general, problem independent, features and outperform the utilization of any single minimization search strategy. We test our methodology on data from the GECCO Workshop on BBO Benchmarking 2012, which contains 21 state-of-the-art solvers run on 24 well-established functions