Active Learning with Adaptive Grids
Given some optimization problem and a series of typically expensive trials of solution candidates taken from a search space, how can we efficiently select the next candidate? We address this fundamental problem using adaptive grids inspired by Kohonen’s self-organizing map. Initially the grid divides the search space into equal simplexes. To select a candidate we uniform randomly first select a simplex, then a point within the simplex. Grid nodes are attracted by candidates that lead to improved evaluations. This quickly biases the active data selection process towards promising regions, without loss of ability to deal with ”surprising” global optima in other areas. On standard benchmark functions the technique performs more reliably than the widely used covariance matrix adaptation evolution strategy.
KeywordsSearch Space Evolution Path Adaptive Grid Evolution Strategy Covariance Matrix Adaptation Evolution Strategy
Unable to display preview. Download preview PDF.
- 1.T. Kohonen, Self-Organizing maps, Springer Verlag 1995Google Scholar
- 2.H. P. Schwefel, Evolution and Optimum Seeking,Wiley 1995Google Scholar
- 4.N. Hansen, A. Ostermeier, “Adapting Arbitrary Normal Mutation Distributions in Evolution Strategies: The Covariance Matrix Adaptation”, IEEE Intern. Conf. on Evolutionary Computation (ICEC) Proceedings, 1996, pp. 312–317Google Scholar
- 5.D. Whitley, K. Mathias, S. Rana, J. Dzubera, “Building Better Test Functions”, Proc. of the 6th Int. Conf. on GAs, Morgan Kaufmann, 1995, pp. 239–246Google Scholar