Optimal robust expensive optimization is tractable

Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions, we (i) discuss the comparison-based constraints (ii) choose a setting in which theoretical tight bounds are known (iii) develop a careful implementation using billiard algorithms, Upper Confidence trees and (iv) experimentally test the tractability of the approach. The results, on still very simple cases, show that the approach, yet still preliminary, could be tested successfully until dimension 10 and horizon 50 iterations within a few hours on a standard computer, with convergence rate far better than the best algorithms. Categories and Subject Descriptors

• Type: Conference
• Year: 2009
• Where: GECCO
• Authors: Philippe Rolet, Michèle Sebag, Olivier Teytaud
• Keywords: Artificial Intelligence, Comparison-based Optimization Algorithms, GECCO 2009, Theoretical Tight Bounds, Upper Confidence Trees