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

DOI10.1023/B:NACO.0000023416.59689.4EMaRDI QIDQ1768786zbMATH OpenOpenAlexFDO

Authors Stefan Kern, S. Müller, Nikolaus Hansen, Dirk Büche, Jiří Očenášek, Petros Koumoutsakos

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

adaptationBayesian optimizationestimation of distribution algorithmevolution strategyevolutionary algorithmlearningprobability distribution

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)

Recommendations

• scientific article; zbMATH DE number 1754721
• A survey of optimization by building and using probabilistic models
• Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
• A Survey on Estimation of Distribution Algorithms
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.

Cited in

(26)

• Efficient covariance matrix update for variable metric evolution strategies
• X-TMCMC: adaptive kriging for Bayesian inverse modeling
• Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
• Implicit subgrid-scale modeling by adaptive deconvolution
• A hybrid method for inversion of 3D DC resistivity logging measurements
• Korali: efficient and scalable software framework for Bayesian uncertainty quantification and stochastic optimization
• Self-adjusting mutation rates with provably optimal success rules
• How to maximize the likelihood function for a DSGE model
• Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms
• Weighted multirecombination evolution strategies
• Black-box optimization using geodesics in statistical manifolds
• Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
• Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
• Speeding up many-objective optimization by Monte Carlo approximations
• Design of robust parameter experiments in a continuous space using an evolutionary optimization algorithm
• Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
• Evolutionary sampling: a novel way of machine learning within a probabilistic framework
• Estimation of distribution algorithms on non-separable problems
• Self-adjusting population sizes for the (1, )-EA on monotone functions
• Global linear convergence of evolution strategies with recombination on scaling-invariant functions
• 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
• Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
• Performance evaluation of multiagent genetic algorithm
• Ant colony optimization for continuous domains

Describes a project that uses

Uses Software

• CMA-ES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768786)