A Simple Yet Efficient Rank One Update for Covariance Matrix Adaptation

10/11/2017
by   Zhenhua Li, et al.
0

In this paper, we propose an efficient approximated rank one update for covariance matrix adaptation evolution strategy (CMA-ES). It makes use of two evolution paths as simple as that of CMA-ES, while avoiding the computational matrix decomposition. We analyze the algorithms' properties and behaviors. We experimentally study the proposed algorithm's performances. It generally outperforms or performs competitively to the Cholesky CMA-ES.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2020

Efficiently updating a covariance matrix and its LDL decomposition

Equations are presented which efficiently update or downdate the covaria...
research
05/28/2018

A parallel implementation of the covariance matrix adaptation evolution strategy

In many practical optimization problems, the derivatives of the function...
research
03/30/2020

The Hessian Estimation Evolution Strategy

We present a novel black box optimization algorithm called Hessian Estim...
research
09/06/2020

Convergence Analysis of the Hessian Estimation Evolution Strategy

The class of algorithms called Hessian Estimation Evolution Strategies (...
research
06/15/2018

A Covariance Matrix Self-Adaptation Evolution Strategy for Optimization under Linear Constraints

This paper addresses the development of a covariance matrix self-adaptat...
research
06/15/2018

A Covariance Matrix Self-Adaptation Evolution Strategy for Linear Constrained Optimization

This paper addresses the development of a covariance matrix self-adaptat...
research
03/22/2022

A Unified Substrate for Body-Brain Co-evolution

The discovery of complex multicellular organism development took million...

Please sign up or login with your details

Forgot password? Click here to reset