par Balaprakash, Prasanna 
;Birattari, Mauro ;Stützle, Thomas
Référence Lecture notes in computer science, 4771 LNCS, page (108-122)
Publication Publié, 2007
;Birattari, Mauro ;Stützle, Thomas Référence Lecture notes in computer science, 4771 LNCS, page (108-122)
Publication Publié, 2007
Article révisé par les pairs
| Résumé : | Finding appropriate values for the parameters of an algorithm is a challenging, important, and time consuming task. While typically parameters are tuned by hand, recent studies have shown that automatic tuning procedures can effectively handle this task and often find better parameter settings. F-Race has been proposed specifically for this purpose and it has proven to be very effective in a number of cases. F-Race is a racing algorithm that starts by considering a number of candidate parameter settings and eliminates inferior ones as soon as enough statistical evidence arises against them. In this paper, we propose two modifications to the usual way of applying F-Race that on the one hand, make it suitable for tuning tasks with a very large number of initial candidate parameter settings and, on the other hand, allow a significant reduction of the number of function evaluations without any major loss in solution quality. We evaluate the proposed modifications on a number of stochastic local search algorithms and we show their effectiveness. © Springer-Verlag Berlin Heidelberg 200 |
