论文信息 - Herding Evolutionary Algorithm

Herding Evolutionary Algorithm

In this paper, we address the problem of black box optimization over binary vectors. We introduce a novel evolutionary algorithm called Herding Evolutionary Algorithm which relies on herding to generate individuals with empirical moments close to those of selected individuals. We report experiments with diverse fitness functions and compare the results of HEA with those of simulated annealing, local search, and PBIL. Although in its early developments, HEA shows promising results.

Arnaud Berny

[1] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

[2] Max Welling,et al. Herding dynamical weights to learn , 2009, ICML '09.

[3] S. Baluja,et al. Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[4] Alexander J. Smola,et al. Super-Samples from Kernel Herding , 2010, UAI.

[5] Max Welling,et al. Herding Dynamic Weights for Partially Observed Random Field Models , 2009, UAI.

[6] Francis R. Bach,et al. On the Equivalence between Herding and Conditional Gradient Algorithms , 2012, ICML.

[7] M. Sebag,et al. A society of hill-climbers , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).