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