Structural coherence of problem and algorithm: An analysis for EDAs on all 2-bit and 3-bit problems

Metaheuristics assume some kind of coherence between decision and objective spaces. Estimation of Distribution algorithms approach this by constructing an explicit probabilistic model of high fitness solutions, the structure of which is intended to reflect the structure of the problem. In this context, “structure” means the dependencies or interactions between problem variables in a probabilistic graphical model. There are many approaches to discovering these dependencies, and existing work has already shown that often these approaches discover “unnecessary” elements of structure - that is, elements which are not needed to correctly rank solutions. This work performs an exhaustive analysis of all 2 and 3 bit problems, grouped into classes based on mononotic invariance. It is shown in [1] that each class has a minimal Walsh structure that can be used to solve the problem. We compare the structure discovered by different structure learning approaches to the minimal Walsh structure for each class, with summaries of which interactions are (in)correctly identified. Our analysis reveals a large number of symmetries that may be used to simplify problem solving. We show that negative selection can result in improved coherence between discovered and necessary structure, and conclude with some directions for a general programme of study building on this work.

[1]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[2]  Qingfu Zhang,et al.  Structure learning and optimisation in a Markov-network based estimation of distribution algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[3]  T. D. Wilson.  Review of: Boslaugh, Sarah and Watters, Paul Andrew Statistics in a nutshell. Sebastopol, CA: O'Reilly, 2008 , 2008, Inf. Res..

[4]  Paul A. Watters,et al.  Statistics in a nutshell - a desktop quick reference , 2008 .

[5]  Gilbert Owusu,et al.  DEUM - Distribution Estimation Using Markov Networks , 2012 .

[6]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[7]  Shingo Mabu,et al.  Use of infeasible individuals in probabilistic model building genetic network programming , 2011, GECCO '11.

[8]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[9]  Fred Glover,et al.  Tabu Search Principles , 1997 .

[10]  Conor Ryan,et al.  Using over-sampling in a Bayesian classifier EDA to solve deceptive and hierarchical problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[11]  Roberto Santana.  A Markov Network Based Factorized Distribution Algorithm for Optimization , 2003, ECML.

[12]  Qingfu Zhang,et al.  Fitness Modeling With Markov Networks , 2013, IEEE Transactions on Evolutionary Computation.

[13]  Martin Pelikan,et al.  Spurious dependencies and EDA scalability , 2010, GECCO '10.

[14]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[15]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[16]  Pedro Larrañaga,et al.  Interactions and dependencies in estimation of distribution algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  Roberto Santana,et al.  On the Taxonomy of Optimization Problems Under Estimation of Distribution Algorithms , 2013, Evolutionary Computation.

[18]  Heinz Mühlenbein,et al.  Evolutionary optimization using graphical models , 2009, New Generation Computing.

[19]  Yi Hong,et al.  Estimation of distribution algorithms making use of both high quality and low quality individuals , 2009, 2009 IEEE International Conference on Fuzzy Systems.

[20]  Siddhartha Shakya,et al.  A Markovianity based optimisation algorithm , 2012, Genetic Programming and Evolvable Machines.

[21]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

[22]  L. Darrell Whitley,et al.  Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.

[23]  David E. Goldberg,et al.  Model accuracy in the Bayesian optimization algorithm , 2011, Soft Comput..

[24]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[25]  Pedro Larrañaga,et al.  Evolutionary computation based on Bayesian classifiers , 2004 .

[26]  L. A. Marascuilo,et al.  Nonparametric and Distribution-Free Methods for the Social Sciences , 1977 .

[27]  Qingfu Zhang,et al.  Approaches to selection and their effect on fitness modelling in an Estimation of Distribution Algorithm , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[28]  John A. W. McCall,et al.  Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings , 2014, GECCO.

[29]  Alden H. Wright,et al.  On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization , 2005, GECCO '05.

[30]  Martin Pelikan,et al.  Influence of selection on structure learning in markov network EDAs: an empirical study , 2012, GECCO '12.

[31]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[32]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[33]  Andrew M. Sutton,et al.  Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.

[34]  Alexander E. I. Brownlee,et al.  Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm , 2009 .

[35]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[36]  Masaharu Munetomo,et al.  Introducing assignment functions to Bayesian optimization algorithms , 2008, Inf. Sci..

[37]  Alden H. Wright,et al.  Efficient Linkage Discovery by Limited Probing , 2003, Evolutionary Computation.

[38]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.