Learning probability distributions in continuous evolutionary algorithms -- a comparative review

DOI10.1023/B:NACO.0000023416.59689.4ezbMath1074.68063OpenAlexW2027964569MaRDI QIDQ1768786

Nikolaus Hansen, Jiri Ocenasek, Stefan Kern, Dirk Büche, Petros Koumoutsakos, Sibylle D. Müller

Publication date: 15 March 2005

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:naco.0000023416.59689.4e

zbMATH Keywords

learning probability distribution evolutionary algorithm adaptation estimation of distribution algorithm evolution strategy Bayesian optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (24)

Black-box optimization using geodesics in statistical manifolds ⋮ Implicit subgrid-scale modeling by adaptive deconvolution ⋮ Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains ⋮ Performance evaluation of multiagent genetic algorithm ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ Global linear convergence of evolution strategies with recombination on scaling-invariant functions ⋮ Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms ⋮ OneMax is not the easiest function for fitness improvements ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ Using Automated Algorithm Configuration for Parameter Control ⋮ Speeding up many-objective optimization by Monte Carlo approximations ⋮ X-TMCMC: adaptive kriging for Bayesian inverse modeling ⋮ Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms ⋮ Self-adjusting mutation rates with provably optimal success rules ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Design of robust parameter experiments in a continuous space using an evolutionary optimization algorithm ⋮ A hybrid method for inversion of 3D DC resistivity logging measurements ⋮ How to maximize the likelihood function for a DSGE model ⋮ Ant colony optimization for continuous domains ⋮ Weighted multirecombination evolution strategies ⋮ Efficient covariance matrix update for variable metric evolution strategies ⋮ Korali: efficient and scalable software framework for Bayesian uncertainty quantification and stochastic optimization ⋮ Estimation of distribution algorithms on non-separable problems

Uses Software

CMA-ES

This page was built for publication: Learning probability distributions in continuous evolutionary algorithms -- a comparative review