AIMech AI

CMA rank-mu covariance update

Mathematical Methods AIMech:CMARankMuCovarianceUpdate DRAFT
A covariance-valued update component introduced in the 2003 CMA-ES construction that forms an equal-weight second moment of selected mutation steps about the old sampling mean and blends it with an evolution-path outer product and the previous search covariance.
Identity Notes & Concept Scope This record isolates the original 2003 equal-weight selected-step second-moment covariance update and its path blend. The maintained 2001 CMA-ES record explicitly excludes this extension; IGO and xNES retain qualified rank-mu correspondences rather than this defining finite component. It is not the whole optimizer, a modern weighted or active covariance rule, or an IPOP restart policy. Fresh postmerge collection at a7303d92795cc371954c527372fce9117342d7b5 checked all 735 native and 442 pinned AIO record identities and bytes. Four searches included ignored and hidden files, yielding 1,529 occurrences grouped into 45 exact contents, all reconciled with earlier research; root read all 45 complete contents. No normalized ID, label, alias or scoped-synonym collision was found for the explicit candidate probes. This is bounded to the pinned inventory and inspected semantic neighborhoods, not an exhaustive absence claim about AI literature. Existing frontier owner 200 is resolved in place; owner 201 and other distinct variants remain separate.

Claims & Grounded Evidence

6 Claims
Mechanism #selected-old-mean-second-moment
For integer search dimension n>=1, current mean m, positive global scale sigma and covariance C=B*D^2*B^T, write each selected offspring step as y_i=(x_i-m)/sigma=B*D*z_i. With an integer mu>=1 selected offspring, the original equal-weight construction forms Z=(1/mu)*sum_i(y_i*y_i^T). The steps use the old sampling mean and scale. Z is their uncentered second moment, not their covariance about the newly selected mean and not the outer product of their average step.
Mechanism #path-and-population-covariance-blend
The source retains the evolution path p_new=(1-c_c)*p+sqrt(c_c*(2-c_c))*sqrt(mu)*mean_i(y_i), then updates the search covariance by C_new=(1-c_cov)*C+c_cov*(alpha*p_new*p_new^T+(1-alpha)*Z). Here alpha is the source alpha_cov in [0,1]. The path outer product represents accumulated mean-step information, while Z uses individual selected steps from the current generation. This is a covariance-update component, not a complete initialization, sampling, selection or termination algorithm.
Scope #blend-endpoints-and-host-boundary
At alpha=1 the blend recovers the rank-one covariance rule reviewed in the source; alpha=0 uses Z as the sole added moment, and alpha=1/mu is the hybrid configuration studied there. The paper labels these Orig-CMA, New-CMA and Hybr-CMA. These are configurations of the construction, not asserted exact aliases for its component identity. The modification leaves the host global step-size adaptation unchanged, so its scalar exponential update is outside the defining Eq. 10–11 component.
Scope #rank-and-positive-definite-domain
Z is positive semidefinite and has rank at most min(mu,n). Equality requires the selected vectors to have the corresponding span; the source’s equality statement is interpreted with this generic full-span qualification. For positive-definite C, alpha in [0,1] and 0<=c_cov<1, the blend remains positive definite. At c_cov=1, the positively weighted path and selected steps must together span the space to ensure positive definiteness. These are exact-arithmetic consequences of the outer-product blend, not numerical-conditioning guarantees.
Scope #neutral-selection-and-path-initialization-scope
Under the paper’s neutral-selection or unchanged selected-law idealization, independent zero-mean selected Gaussian steps with covariance C give E[Z]=C. This is not an unbiasedness claim under arbitrary fitness selection. The analogous path second moment additionally depends on its distribution: with frozen C, p_0=0 and 0<c_c<=1, the first path has E[p_1*p_1^T]=c_c*(2-c_c)*C. Consequently the first covariance expectation is [1-c_cov*alpha*(1-c_c)^2]*C. This bounded curator derivation distinguishes zero initialization from a stationary path idealization; it is not a theorem about the full adaptive run.
Scope #empirically-chosen-covariance-rate
The source couples the new covariance mechanism to an empirical learning-rate prescription: Equation 12 blends the original rate 2/(n+sqrt(2))^2 with min(1,(2*mu-1)/((n+2)^2+mu)), using alpha and 1-alpha. Section 4 obtains this expression by trial and error on ellipsoidal tests and chooses conservative rates below the measured optima. Its experimental choice lambda=4*mu is not a universal requirement of the covariance formula, and the prescription is not asserted optimal for arbitrary objectives.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:MathematicalFunction
Mathematical Function
related_match The defining equations give an explicit matrix-valued mathematical rule: specified covariance, updated path, selected-step moment and scalar blend/rate inputs determine the new covariance. This is an informative relation to the broad pinned function definition, not merely the generic computability of a whole optimizer. It does not assert equivalence, an upstream subclass edge or a scalar activation, and does not import the host’s exponential step-size operation.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
hansen2003
Nikolaus Hansen, Sibylle D. Müller, Petros Koumoutsakos
primary paper
full_text
ID: https://doi.org/10.1162/106365603321828970
sha256:1e3e35799fda…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-15T06:13:45Z
Updated: 2026-10-15T06:13:45Z
Source File: data/curated/CMARankMuCovarianceUpdate.yaml