Evolutionary Strategy (CMA-ES) — Covariance Matrix Adaptation
Covariance Matrix Adaptation Evolution Strategy (CMA-ES) · Also known as: CMA-ES, Evolution Strategy, Evrimsel Strateji (CMA-ES), self-adapting evolution strategy
CMA-ES, short for Covariance Matrix Adaptation Evolution Strategy, is a modern derivative-free optimizer for continuous black-box functions introduced by Hansen and Ostermeier in 2001. It maintains a population of candidate solutions drawn from a multivariate normal distribution and iteratively updates the distribution's mean, step size, and full covariance matrix to steer the search toward better regions of the parameter space. It has become the de-facto standard for continuous black-box optimization and is widely used in neural architecture search and reinforcement-learning policy optimization.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
CMA-ES is appropriate when the objective function is continuous, possibly non-convex, multimodal, or noisy, and when gradient information is unavailable or too expensive to compute. The ideal dimensionality range is roughly 10 to 1000 parameters; below 10 dimensions simpler methods are often sufficient, and above 1000 the quadratic memory cost of the covariance matrix can become prohibitive. There is no minimum sample size requirement in the statistical sense — the algorithm itself generates its own evaluation points. CMA-ES is a natural fit for hyperparameter tuning, neural architecture search, reinforcement-learning policy optimization, and engineering design problems where the simulator provides only black-box outputs.
Strengths & limitations
- Requires no gradient information — works on any callable objective function, including noisy or simulation-based ones.
- Learns the local curvature of the search landscape through covariance adaptation, allowing it to navigate elongated and ill-conditioned search spaces that defeat gradient-free methods with fixed search distributions.
- Invariant to order-preserving transformations of the objective function and to rotations of the search space, making it robust across a wide variety of problem geometries.
- Well-suited for moderate-to-high-dimensional continuous problems (10–1000 parameters) with a single tunable hyperparameter — the initial step size.
- Quadratic memory and per-generation computational cost in the number of dimensions limits applicability beyond roughly 1000 parameters without dimensionality-reduction variants.
- Converges to a local optimum in the absence of restarts; for highly multimodal landscapes, multiple restarts (IPOP-CMA-ES or BIPOP-CMA-ES) are needed.
- Not suited to discrete or combinatorial search spaces — the method is inherently defined over continuous real-valued vectors.
Frequently asked
How does CMA-ES differ from a simple genetic algorithm?
A classic genetic algorithm maintains a population and applies crossover and mutation with fixed operators. CMA-ES instead models the population as samples from a multivariate normal distribution and continuously adapts that distribution — its mean, step size, and full covariance matrix — based on which solutions were successful. This allows CMA-ES to learn the shape of the loss landscape and navigate correlated, ill-conditioned spaces far more efficiently than a genetic algorithm with fixed operators.
Does CMA-ES guarantee finding the global optimum?
No. CMA-ES is a local search method in the sense that a single run can converge to a local optimum. For multimodal landscapes, multiple independent restarts — possibly with increasing population sizes (IPOP-CMA-ES) — are recommended to improve coverage of the search space.
What is the most important hyperparameter to set?
The initial step size sigma is the single most influential hyperparameter. A good heuristic is to set it so that the expected optimum lies within roughly three sigma of the starting point. Population size and the maximum number of evaluations are secondary controls; the default population size formula (4 + floor(3 * ln(dimension))) works well in practice.
Can CMA-ES handle noisy objective functions?
Yes. Because CMA-ES uses only rank-order information from the population — not absolute function values — it is relatively robust to noise. For highly noisy evaluations, increasing the population size or averaging multiple evaluations per candidate can further improve robustness.
Sources
- Hansen, N. & Ostermeier, A. (2001). Completely Derandomized Self-Adaptation in Evolutionary Strategies. Evolutionary Computation, 9(2), 159-195. DOI: 10.1162/106365601750190398 ↗
- Hansen, N. (2016). The CMA Evolution Strategy: A Tutorial. arXiv:1604.00772. link ↗
How to cite this page
ScholarGate. (2026, June 1). Covariance Matrix Adaptation Evolution Strategy (CMA-ES). ScholarGate. https://scholargate.app/en/optimization/evolutionary-strategy
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesian OptimizationOptimization↔ compare
- Genetic AlgorithmOptimization↔ compare
- Particle Swarm OptimizationOptimization↔ compare
- Robust OptimizationOptimization↔ compare
- Surrogate-Based OptimizationOptimization↔ compare