A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity

  • Authors:
  • Raymond Ros;Nikolaus Hansen

  • Affiliations:
  • Univ. Paris-Sud, LRI, UMR 8623 / INRIA Saclay, projet TAO, Orsay, France F-91405;Microsoft Research---INRIA Joint Centre, Orsay Cedex, France 91893

  • Venue:
  • Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a simple modification of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for high dimensional objective functions, reducing the internal time and space complexity from quadratic to linear. The covariance matrix is constrained to be diagonal and the resulting algorithm, sep-CMA-ES, samples each coordinate independently. Because the model complexity is reduced, the learning rate for the covariance matrix can be increased. Consequently, on essentially separable functions, sep-CMA-ES significantly outperforms CMA-ES . For dimensions larger than a hundred, even on the non-separable Rosenbrock function, the sep-CMA-ES needs fewer function evaluations than CMA-ES .