Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Learning probability distributions in continuous evolutionary algorithms– a comparative review
Natural Computing: an international journal
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Covariance Matrix Adaptation for Multi-objective Optimization
Evolutionary Computation
Stochastic search using the natural gradient
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Efficient natural evolution strategies
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Exponential natural evolution strategies
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
High dimensions and heavy tails for natural evolution strategies
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
The recently introduced family of natural evolution strategies (NES), a novel stochastic descent method employing the natural gradient, is providing a more principled alternative to the well-known covariance matrix adaptation evolution strategy (CMA-ES). Until now, NES could only be used for single-objective optimization. This paper extends the approach to the multi-objective case, by first deriving a (1+1) hillclimber version of NES which is then used as the core component of a multi-objective optimization algorithm. We empirically evaluate the approach on a battery of benchmark functions and find it to be competitive with the state-of-the-art.