Theory of estimation-of-distribution algorithms

[1]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[2]  Per Kristian Lehre,et al.  Black-Box Search by Unbiased Variation , 2010, GECCO '10.

[3]  Xin Yao,et al.  On the analysis of average time complexity of estimation of distribution algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

[4]  Qingfu Zhang,et al.  On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm , 2004, IEEE Transactions on Evolutionary Computation.

[5]  Timo Kötzing,et al.  Optimizing expected path lengths with ant colony optimization using fitness proportional update , 2013, FOGA XII '13.

[6]  Benjamin Doerr,et al.  Ants easily solve stochastic shortest path problems , 2012, GECCO '12.

[7]  Tobias Friedrich,et al.  EDAs cannot be Balanced and Stable , 2016, GECCO.

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

[9]  Stephen R. Marsland,et al.  Convergence Properties of (μ + λ) Evolutionary Algorithms , 2011, AAAI.

[10]  Andrew M. Sutton,et al.  On the runtime dynamics of the compact genetic algorithm on jump functions , 2018, GECCO.

[11]  Jonathan L. Shapiro,et al.  The Sensitivity of PBIL to Its Learning Rate, and How Detailed Balance Can Remove It , 2002, FOGA.

[12]  J. A. Lozano,et al.  Analyzing the PBIL Algorithm by Means of Discrete Dynamical Systems , 2000 .

[13]  Per Kristian Lehre,et al.  When is an estimation of distribution algorithm better than an evolutionary algorithm? , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[15]  David E. Goldberg,et al.  Time Complexity of genetic algorithms on exponentially scaled problems , 2000, GECCO.

[16]  Yong Gao,et al.  Space Complexity of Estimation of Distribution Algorithms , 2005, Evolutionary Computation.

[17]  Qingfu Zhang,et al.  On the convergence of a class of estimation of distribution algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[18]  Jonathan L. Shapiro,et al.  Drift and Scaling in Estimation of Distribution Algorithms , 2005, Evolutionary Computation.

[19]  Dirk Sudholt,et al.  Update Strength in EDAs and ACO: How to Avoid Genetic Drift , 2016, GECCO.

[20]  Markus H ohfeld,et al.  Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[21]  Duc-Cuong Dang,et al.  Level-Based Analysis of Genetic Algorithms and Other Search Processes , 2014, bioRxiv.

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

[23]  Heinz Mühlenbein,et al.  Convergence Theory and Applications of the Factorized Distribution Algorithm , 2015, CIT 2015.

[24]  Carola Doerr,et al.  OneMax in Black-Box Models with Several Restrictions , 2015, Algorithmica.

[25]  Dirk Sudholt,et al.  Medium step sizes are harmful for the compact genetic algorithm , 2018, GECCO.

[26]  Qingfu Zhang,et al.  On the convergence of a factorized distribution algorithm with truncation selection , 2004, Complex..

[27]  Dirk Sudholt,et al.  A few ants are enough: ACO with iteration-best update , 2010, GECCO '10.

[28]  Heinz Mühlenbein,et al.  On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation , 1994, PPSN.

[29]  Xin Yao,et al.  Analysis of Computational Time of Simple Estimation of Distribution Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

[30]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[31]  Jonathan L. Shapiro,et al.  Diversity Loss in General Estimation of Distribution Algorithms , 2006, PPSN.

[32]  Carsten Witt,et al.  Domino convergence: why one should hill-climb on linear functions , 2018, GECCO.

[33]  Per Kristian Lehre,et al.  University of Birmingham Level-based analysis of the population-based incremental learning algorithm , 2018 .

[34]  D. Goldberg,et al.  Domino convergence, drift, and the temporal-salience structure of problems , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[35]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[36]  Michael Kolonko,et al.  Asymptotic Properties of a Generalized Cross-Entropy Optimization Algorithm , 2014, IEEE Transactions on Evolutionary Computation.

[37]  Andrew M. Sutton,et al.  Robustness of Ant Colony Optimization to Noise , 2015, Evolutionary Computation.

[38]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[39]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[40]  Carsten Witt,et al.  Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax , 2017, FOGA '17.

[41]  Per Kristian Lehre,et al.  Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration , 2017, GECCO.

[42]  Andrew M. Sutton,et al.  The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise , 2017, IEEE Transactions on Evolutionary Computation.

[43]  Kumara Sastry,et al.  Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA) , 2006, Scalable Optimization via Probabilistic Modeling.

[44]  Stefan Droste,et al.  A rigorous analysis of the compact genetic algorithm for linear functions , 2006, Natural Computing.

[45]  Michael Kolonko,et al.  Stochastic Runtime Analysis of the Cross-Entropy Algorithm , 2017, IEEE Transactions on Evolutionary Computation.

[46]  Per Kristian Lehre,et al.  Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise , 2019, GECCO.

[47]  Duc-Cuong Dang,et al.  Simplified Runtime Analysis of Estimation of Distribution Algorithms , 2015, GECCO.

[48]  Petr Posík.  Estimation of Distribution Algorithms , 2006 .

[49]  Carsten Witt,et al.  Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.

[50]  Dirk Sudholt,et al.  On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization , 2018, Algorithmica.

[51]  Benjamin Doerr,et al.  The Runtime of the Compact Genetic Algorithm on Jump Functions , 2019, Algorithmica.

[52]  Dirk Sudholt,et al.  A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems , 2012, Algorithmica.

[53]  Benjamin Doerr,et al.  A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost , 2019, GECCO.

[54]  Benjamin Doerr,et al.  Significance-Based Estimation-of-Distribution Algorithms , 2018, IEEE Transactions on Evolutionary Computation.

[55]  Xin Yao,et al.  Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins , 2009, 2009 IEEE Congress on Evolutionary Computation.

[56]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .