Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

CMA-ES

Optimization Algorithm

Covariance matrix adaptation evolution strategy, or CMA-ES, is a stochastic, derivative-free strategy for numerical optimization of non-linear or non-convex continuous problems, belonging to the class of evolutionary algorithms. New candidate solutions are sampled from a multivariate normal distribution, and the covariance matrix adaptation step updates the covariance matrix of that distribution to learn a second-order model of the objective function, similar in spirit to approximating the inverse Hessian matrix in a quasi-Newton method, while requiring only a ranking of candidate solutions rather than derivatives or an explicit objective function. It is particularly useful when the underlying objective function is ill-conditioned.

Connections

In Field

Source CMA-ES (Wikipedia)
Sources
Wikidata: CMA-ES
Wikidata Q505588, class allow-list match (w-wdresolver-0926)View the Source
CMA-ES (Wikipedia)
  • In Field: Evolutionary Computation, Lead sentence
    Covariance matrix adaptation evolution strategy (CMA-ES) is a particular kind of strategy for numerical optimization.
  • In Group: Metaheuristic Optimization Algorithms, Lead
    Covariance matrix adaptation evolution strategy (CMA-ES) is a particular kind of strategy for numerical optimization.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.