ReACT: Real-Time Algorithm Configuration through Tournaments

The success or failure of a solver is oftentimes closely tied to the proper configuration of the solver's parameters. However, tuning such parameters by hand requires expert knowledge, is time consuming, and is error-prone. In recent years, automatic algorithm configuration tools have made significant advances and can nearly always find better parameters than those found through hand tuning. However, current approaches require significant offline computational resources, and follow a train-once methodology that is unable to later adapt to changes in the type of problem solved. To this end, this paper presents Real-time Algorithm Configuration through Tournaments (ReACT), a method that does not require any offline training to perform algorithm configuration. ReACT exploits the multi-core infrastructure available on most modern machines to create a system that continuously searches for improving parameterizations, while guaranteeing a particular level of performance. The experimental results show that, despite the simplicity of the approach, ReACT quickly finds a set of parameters that is better than the default parameters and is competitive with state-of-the-art algorithm configurators.

[1]  Yoav Shoham,et al.  Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[2]  Carlos Ansótegui,et al.  A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms , 2009, CP.

[3]  CHARLES AUDET,et al.  Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization , 2006, SIAM J. Optim..

[4]  Jacek M. Zurada,et al.  Swarm and Evolutionary Computation , 2012, Lecture Notes in Computer Science.

[5]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[6]  Yuri Malitsky,et al.  ISAC - Instance-Specific Algorithm Configuration , 2010, ECAI.

[7]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[8]  Kevin Leyton-Brown,et al.  Parallel Algorithm Configuration , 2012, LION.

[9]  Thomas Stützle,et al.  F-Race and Iterated F-Race: An Overview , 2010, Experimental Methods for the Analysis of Optimization Algorithms.

[10]  Thomas Bartz-Beielstein,et al.  Experimental Methods for the Analysis of Optimization Algorithms , 2010 .

[11]  Alberto Delgado,et al.  Generating Optimal Stowage Plans for Container Vessel Bays , 2009, CP.

[12]  Mauro Brunato,et al.  Reactive Search and Intelligent Optimization , 2008 .

[13]  Holger H. Hoos,et al.  Programming by optimization , 2012, Commun. ACM.

[14]  Barry O'Sullivan,et al.  Evolving Instance Specific Algorithm Configuration , 2021, SOCS.

[15]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[16]  Kevin P. Murphy,et al.  Time-Bounded Sequential Parameter Optimization , 2010, LION.

[17]  Barry O'Sullivan,et al.  Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem , 2013, CPAIOR.

[18]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[19]  A. E. Eiben,et al.  Parameter tuning for configuring and analyzing evolutionary algorithms , 2011, Swarm Evol. Comput..