---
title: 'Memetic CMA-ES: Hybrid Evolutionary Strategy'
url: https://www.emergentmind.com/topics/memetic-covariance-matrix-adaptation-evolution-strategy-memetic-cma-es
type: topic
---

# Memetic CMA-ES: Hybrid Evolutionary Strategy

Memetic Covariance Matrix Adaptation Evolution Strategy (memetic CMA-ES) refers to a class of evolutionary optimization algorithms that hybridize the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) with complementary global or local search mechanisms, hierarchies, or constraint-handling strategies, resulting in multi-stage or multi-agent frameworks exhibiting memetic (i.e., cooperative/parallel) exploration and exploitation. Memetic CMA-ES variants have demonstrated superior performance on complex multimodal landscapes, nonconvex constraints (notably bilinear matrix inequalities), and ill-posed regions characterized by objective insensitivity, by leveraging synergies among stochastic search, structural memory, and adaptive local refinement [1903.09085, 2601.08168, 1905.07288, 1810.02702].

## 1. Core Principles and Algorithmic Structure

Memetic CMA-ES algorithms merge the self-adaptive mutation and covariance modeling of CMA-ES with auxiliary procedures designed to partition the search space, exploit density information, or enforce feasibility. Four archetypal frameworks can be distinguished:

- **Online search-history memetic restarts:** A global search component (e.g., a continuous non-revisiting genetic algorithm, cNrGA) partitions the decision space via binary space partitioning (BSP) trees, detects high-activity subregions, and triggers local CMA-ES restarts (HR-CMA-ES) within these Regions Of Interest (ROIs). Tree-based archiving enables non-revisiting enforcement and adaptive region blocking [1903.09085].
- **Embedded local refinement:** Each candidate sampled by the global CMA-ES undergoes a local (1+1)-CMA-ES phase with restricted step-size and short horizon, refining it prior to selection. This approach is effective in problems with narrow or highly nonconvex feasible sets, e.g., BMI-constrained control design [2601.08168].
- **Hierarchical multi-deme/hierarchic strategies:** HMS-CMA-ES organizes demes in a fixed-depth parent–child tree, sprouting localized CMA-ES searches around promising basins. Density-based clustering and Mahalanobis proximity are used to approximate and separate regions of objective insensitivity [1905.07288].
- **Memetic viability evolution:** Multiple local (1+1)-ViE-CMA-ES units, each constrained by per-unit viability boundaries on constraints, are coordinated by a scheduler balancing between local adaptation and global DE-based recombination. Viability boundaries adaptively drive the population toward feasibility [1810.02702].

All variants share the use of CMA-ES as the principal local optimizer, inheriting its step-size control, rank-based selection, and covariance adaptation, but extend the standard loop by embedding global navigation, multi-region coordination, or advanced constraint-handling.

## 2. Search Space Partitioning and Memetic Loop Designs

The partitioning and memetic sequencing mechanisms are foundational in these frameworks:

- **BSP-tree Search History (HR-CMA-ES):** cNrGA continuously explores, maintaining a BSP-tree over all visited points. When leaf depth exceeds a threshold (derived from the intended CMA-ES population size and overall evaluation budget), the associated region is handed off as an ROI. Once exploited by CMA-ES, the subtree is blocked, ensuring no region is searched twice [1903.09085].
- **Hierarchical Demes (HMS-CMA-ES):** Global search is handled by root demes using baseline EAs; promising demes (subpopulations) sprout children that inherit the parent’s best solution and perform intensive CMA-ES-based local search. Clustering and density-based merging ensure region separation and coverage [1905.07288].
- **Adaptive Scheduler (MemVIE):** Each CMA-ES unit operates a local search; an adaptive scheduler, using credit assignment on recent success rates, allocates evaluations either to advancing a local unit or to global recombination (via DE) on the means of multiple units [1810.02702].

These designs enable both large-scale global exploration and rapid local exploitation, mitigate redundant region revisiting, and act as explicit mechanisms for balancing multimodality and ill-posedness in continuous spaces.

## 3. Local Search: CMA-ES Component and Embedded Refinement

CMA-ES subproblems in memetic frameworks typically employ the following update rules:

- **Sampling:** Each generation samples $\lambda$ offspring via
  \[
    x_i^{(t)} = m^{(t)} + \sigma^{(t)}\,y_i^{(t)}, \quad y_i^{(t)} \sim \mathcal{N}(0,\,C^{(t)})
  \]
- **Mean and Covariance Updates:**
  \[
    m^{(t+1)} = \sum_{i=1}^{\mu} w_i x_{i:\lambda}^{(t)}
  \]
  \[
    C^{(t+1)} = (1 - c_1 - c_\mu) C^{(t)} + c_1 p_c^{(t+1)} (p_c^{(t+1)})^\top + c_\mu \sum_{i=1}^\mu w_i y_{i:\lambda}^{(t)} (y_{i:\lambda}^{(t)})^\top
  \]
- **Step-size Control:**
  \[
    \sigma^{(t+1)} = \sigma^{(t)}\, \exp\left( \frac{c_\sigma}{d_\sigma} \left(\frac{\|p_\sigma^{(t+1)}\|}{E\|\mathcal{N}(0,I)\|} - 1\right) \right)
  \]

Memetic extensions include local (1+1)-CMA-ES refinements applied to each offspring, with the candidate subject to $t_s$ local steps using reduced step-size, adaptive success rates, and rapid covariance updates [2601.08168, 1810.02702].

## 4. Constraint Handling and Objective Insensitivity Regions

Memetic CMA-ES variants tailored for constrained or ill-posed problems embed additional mechanisms:

- **Viability Boundaries:** Each local search unit maintains boundaries for inequality constraints, adapting them downward as solutions improve. Only feasible solutions w.r.t these boundaries are retained for update [1810.02702].
- **Explicit Penalization:** For BMI-constrained problems, penalization of large gain norms and the assignment of a prohibitive fitness to infeasible candidates are critical. The fitness is expressed as
  \[
    f_{\mathrm{BMI}}(\alpha) = -\,\|G_{\mathrm{cl}}(\alpha)\|_\infty - \beta\,\|\alpha\|_2 - M\cdot\mathbf{1}_{ \{ \alpha~\text{infeasible} \} }
  \]
  [2601.08168].
- **Density-based Region Estimation:** In HMS-CMA-ES, the Mahalanobis distance of CMA-ES’s fitted normal distribution clusters sampled points belonging to insensitivity regions; downstream algorithms further refine and merge clusters detected in high-density regions to approximate the volume and boundaries of such regions [1905.07288].

## 5. Empirical Evaluations and Performance Comparisons

Extensive benchmarking has demonstrated the practical benefits of memetic CMA-ES approaches:

- **CEC 2013/2017 Benchmarks:** HR-CMA-ES (cNrGA + CMA-ES restarts) attained the best overall ranks, outperformed cNrGA in 18 of 28 cases (10D, CEC 2013), and regularly outmatched standalone CMA-ES on multimodal functions [1903.09085].
- **BMI-Constrained Control:** On $H_\infty$ controller synthesis (47 COMPleib problems) and spectral abscissa optimization, memetic CMA-ES achieved success rates of 85.11% and 73.3%, respectively, compared to 10.64–40% for state-of-the-art solvers and standard CMA-ES. Closed-loop controllers synthesized by memetic CMA-ES display improved disturbance rejection and more favorable gain characteristics [2601.08168].
- **Insensitivity Region Approximation:** On synthetic test problems with high region count and multimodality (e.g., Rastrigin 4D with 27 minima), HMS-CMA-ES achieved higher minimum coverage and lower Hausdorff error than NEA2; clusters aligned better with true insensitivity regions [1905.07288].
- **Constrained Engineering Problems:** In CEC 2006 inequalities-only suite and four engineering design cases, MemVIE (memetic viability evolution) achieved 100% success with fewer function evaluations than DE, CMA, PSO, and other memetic hybrids, evidencing the value of adaptive local-global scheduling and viability adaptation [1810.02702].

## 6. Key Parameters and Implementation Guidance

Principal settings to ensure robust operation include:

| Parameter            | Recommended Value/Computation                | Source          |
|----------------------|----------------------------------------------|-----------------|
| Population size λ    | $4+\lfloor 3\ln D\rfloor$                    | 1903.09085, 2601.08168 |
| Subtree depth k (ROI)| $k=\lceil\log_2\,\lambda\rceil$              | 1903.09085      |
| CMA-ES step-size σ   | Initially $0.3\,\max x_{\sigma a}$ or σ/10   | 1903.09085, 2601.08168 |
| CMA-ES termination   | Default: stall, max evals, ill-cond. matrix  | 1903.09085      |
| Viability: $P_{\text{target}}$| $2/11$                            | 1810.02702      |
| Local CMA-ES iter.   | $t_s = 20$                                   | 2601.08168      |
| Surrogate region tolerance ε| 0.1                                   | 1905.07288      |

For viability evolution, active covariance reduction is used along infeasible constraint directions, and Deb’s rules are employed for solution ranking. Hierarchic and clustered variants utilize Mahalanobis-distance thresholds and “hollow-ridge” tests to merge overlapped clusters [1905.07288].

## 7. Extensions, Limitations, and Research Directions

Identified strengths include robust coverage and exploitation of multimodal or insensitive landscapes, principled avoidance of redundant exploitation, and strong performance under black-box, nonconvex, or constrained regimes. Limitations stem from increased parameterization (e.g., deme sprout distance, scheduler control), surrogate modeling costs in high dimensions, and the need for problem-dependent adjustment of local search budgets and constraint adaptation rates [1905.07288, 1810.02702]. Extensions proposed include:

- Multi-objective adaptations via Pareto-based selection in the hierarchy.
- Hardware-in-the-loop or real-time retuning deployments for controller synthesis.
- Integration of advanced surrogates (e.g., DNN-based models) for insensitivity boundary estimation.
- Robustness to model mismatch and uncertain or time-varying constraint sets [1905.07288, 2601.08168].

Memetic CMA-ES algorithms constitute a versatile, empirically validated family for globally multimodal, locally deceptive, or constraint-dense optimization problems, advancing the state of practice in black-box, high-complexity search scenarios [1903.09085, 1810.02702, 1905.07288, 2601.08168].

Source: https://www.emergentmind.com/topics/memetic-covariance-matrix-adaptation-evolution-strategy-memetic-cma-es