Adaptive coordinate descent
Authors:
Open Access
- 12 July 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 885-892
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Convergence of a Block Coordinate Descent Method for Nondifferentiable MinimizationJournal of Optimization Theory and Applications, 2001
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961