Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization

Given the current glut of heuristic algorithms for the optimization of continuous functions, in some case characterized by complex schemes with parameters to be hand-tuned, it is an interesting research issue to assess whether competitive performance can be obtained by relying less on expert developers (whose intelligence can be a critical component of the success) and more on automated self-tuning schemes.

[1]  Roberto Battiti,et al.  Learning with first, second, and no derivatives: A case study in high energy physics , 1994, Neurocomputing.

[2]  Stephen F. Smith,et al.  The Max K-Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection , 2005, AAAI.

[3]  Philip W. L. Fong.  A Quantitative Study of Hypothesis Selection , 1995, ICML.

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

[5]  Stephen F. Smith,et al.  An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem , 2006, AAAI.

[6]  A. Zhigljavsky.  Stochastic Global Optimization , 2008, International Encyclopedia of Statistical Science.

[7]  A. A. Zhigli︠a︡vskiĭ,et al.  Stochastic Global Optimization , 2007 .

[8]  Stephen F. Smith,et al.  A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem , 2006, CP.

[9]  Jürgen Schmidhuber,et al.  Learning dynamic algorithm portfolios , 2006, Annals of Mathematics and Artificial Intelligence.

[10]  Mauro Brunato,et al.  Learning While Optimizing an Unknown Fitness Surface , 2008, LION.

[11]  Stephen F. Smith,et al.  Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory , 2004, CP.

[12]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[13]  Mauro Birattari,et al.  The irace Package: Iterated Race for Automatic Algorithm , 2011 .

[14]  R. Battiti,et al.  A Memory-Based RASH Optimizer , 2006 .

[15]  Eric Horvitz,et al.  Dynamic restart policies , 2002, AAAI/IAAI.

[16]  David Maxwell Chickering,et al.  A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report) , 2001, Electron. Notes Discret. Math..

[17]  Yaroslav D. Sergeyev,et al.  Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives , 2013, SIAM J. Optim..

[18]  Stephen F. Smith,et al.  Boosting stochastic problem solvers through online self-analysis of performance , 2003 .

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

[20]  Roberto Battiti,et al.  The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization , 1996, Ann. Oper. Res..

[21]  Roberto Battiti,et al.  Reinforcement Learning and Reactive Search: an adaptive MAX-SAT solver , 2008, ECAI.