`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
Convergence of a block coordinate descent method for nondifferentiable minimization
Journal of Optimization Theory and Applications
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Adaptive Encoding: How to Render Search Coordinate System Invariant
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Mirrored sampling and sequential selection for evolution strategies
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Comparison-based optimizers need comparison-based surrogates
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
| Hi-index | 0.00 |
Independence from the coordinate system is one source of efficiency and robustness for the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). The recently proposed Adaptive Encoding (AE) procedure generalizes CMA-ES adaptive mechanism, and can be used together with any optimization algorithm. Adaptive Encoding gradually builds a transformation of the coordinate system such that the new coordinates are as decorrelated as possible with respect to the objective function. But any optimization algorithm can then be used together with Adaptive Encoding, and this paper proposes to use one of the simplest of all, that uses a dichotomy procedure on each coordinate in turn. The resulting algorithm, termed Adaptive Coordinate Descent (ACiD), is analyzed on the Sphere function, and experimentally validated on BBOB testbench where it is shown to outperform the standard (1+1)-CMA-ES, and is found comparable to other state-of-the-art CMA-ES variants.