Directing Open-Ended Evolution in Artificial Life via Multi-Scale Path Divergence

1Constructor University, Bremen, 2Constructor Knowledge Labs, Bremen, 3Institute for Functional Intelligent Materials, NUS, 4Radboud University, Nijmegen

A single explicit formula that drives open-ended evolution in artificial life — and reads back a physical signature of living matter the metric was never optimized for.

Three artificial-life substrates · one recipe

TL;DR

Open-ended evolution in artificial life is typically driven by uninterpretable, black-box neural-network complexity metrics, leaving life-like systems disconnected from physical theories of complexity. We introduce MSPD (Multi-Scale Path Divergence, $D_P$) — a renormalization-group-inspired scalar that quantifies the temporal multiscale organization of heterogeneity in local transition laws. MSPD is an explicit formula that plays a dual role: as a gradient-free fitness function and as a post-hoc analytical lens on any simulation that exposes local transition laws.

Three claims, retained for this version of the paper:

  • MSPD-optimized parameters produce higher held-out complexity scores than matched random parameters from the same substrate (C1).
  • High-$\Delta H$ states correspond to states with higher instability to external interventions — the metric tracks the biology of the dynamics, not noise (C2).
  • Higher MSPD corresponds to stronger scale-dependent frustration, linking MSPD post-hoc to the frustration criterion of biological complexity (Wolf et al., Vanchurin et al.) without the metric being optimized for it (C5).
  • The protocol transfers across three substrates: Flow-Lenia, Life-like cellular automata, and Particle Life++ (C6).

Two nested loops

Open-ended evolution is a two-loop setup. An inner loop applies a fixed rule $\theta$ to states, generating a trajectory. An outer loop rescores the trajectory with some scalar — the "compass" — and mutates $\theta$. The compass is the bottleneck of the field: today, it's typically a neural network (ASAL, Leniabreeder), with no link to physical theories of complexity. MSPD is an explicit, RG-grounded alternative.

Two nested loops: inner state dynamics under fixed rule θ; outer loop computes D_P, mutates θ via CMA-ES, feeds new θ back into inner loop.
Outer loop evolves the rule of the inner loop.

The metric

MSPD is a temporal extension of spatial Multi-Scale Structural Complexity (Bagrov et al. 2020). The RG architecture is inherited intact: the spatial coarse-graining scale $\lambda$ is replaced by an observation window $W$ on time, and cross-scale dissimilarity is computed in trajectory-distribution space rather than image space.

$$ D_P \;=\; \int \frac{\bigl\lVert \partial_{\log r}\, h_r \bigr\rVert^{2}}{\lVert h_r \rVert^{2} + \eta^{2}} \, dq(\log r) $$

where the heterogeneity trace $h$ measures, at every state $x$ along the trajectory, the average pairwise divergence between local transition laws at sites $i$ and $j$:

$$ h(x) \;=\; \iint_{\mathcal{I}\times\mathcal{I}} D\bigl(T_i(x),\, T_j(x)\bigr) \, m(di)\, m(dj) $$
$T_i(x)$ — local transition law at site $i$ in state $x$ $D$ — distance between transition laws (sliced-Wasserstein in practice) $r$ — temporal scale (window size)

From trajectory to scalar

Pipeline: trajectory ξ under fixed θ → local transition-law estimation via SW₁ divergence → windowed heterogeneity trace ΔĤ_k → cross-scale aggregation → MSPD scalar.
Inner loop · MSPD computation from trajectory ξ to scalar $D_P$.

Pipeline on real data

Lagrangian tracers in a Flow-Lenia rollout
① Track local carriers
ΔH heatmap over windows and lags
② Heterogeneity map $\Delta H(W, \tau)$
Cross-scale aggregation of the heterogeneity trace
③ Aggregate across scales → $D_P$

How the MSPD search over rules works

For each substrate, the outer loop walks a different rule space. Life-like cellular automata are small enough to enumerate exhaustively — every one of the 218 totalistic rules is scored by MSPD on the same evaluation budget. For Flow-Lenia and Particle Life++ the rule space is continuous; we replace enumeration with Sep-CMA-ES, a gradient-free evolutionary optimizer, but the four-step recipe below is otherwise identical.

Four-panel CA-sweeping pipeline: enumerate 262,144 Life-like rules, simulate each on a 64×64 toroidal grid for 512 steps, score by MSPD over local transitions, rank and keep the top rules.
CA case shown — enumerate · simulate · score by MSPD · rank. The top rules become the "optimized" entries in the C1 result.

C1 · Optimization works

On Particle Life++, MSPD-optimized parameters produce higher held-out scores than matched random parameters from the same substrate: 7/7 matched groups positive, p = 0.008. Confirmed on Life-like CA by exhaustive rule sweep. Directional but underpowered on Flow-Lenia (6/9, p = 0.25) under the current optimization budget.

Random parameters — drifts into a frozen, low-motion basin.
$D_P$-optimized — persistent, reorganizing groups.

Sanity check: on synthetic controls, $D_P$ is zero for white noise, zero for a single drifting blob, and low for stationary role mixtures — it measures temporally organized heterogeneity, not motion magnitude or visual novelty.

C2 · Spikes mark branch points

A locally elevated $\Delta H$ marks states where a small perturbation sends the future down divergent paths. Quiet states heal. The metric responds to dynamics, not noise — confirmed within source trajectories (8/9 positive, pooled Spearman $r$ = 0.62).

Low $D_P$ · perturbed futures heal.
High $D_P$ · perturbed futures fan out.

C5 · Optimized systems develop frustration

What is frustration? Put three antiferromagnetic spins on a triangle. Each pair wants to point opposite — but the three constraints cannot all be satisfied at once. The system has many local-minimum configurations of nearly equal energy, separated by barriers. This is frustration — competing local rules with no globally consistent ground state — and the result is a rugged energy landscape where the basin a system ends up in depends on its early history, not just its current state. Wolf, Katsnelson & Koonin (2018) and Vanchurin et al. (2022) argue: living matter sits in this regime.

Rugged energy landscape with two trajectories diverging into different basins under early constraint.
Rugged landscape · early history selects the basin.

Operationalization · three matched rollouts per checkpoint

For each checkpoint $\theta$, run three matched rollouts: $A_\theta$ (same seed, free), $C_\theta$ (different seed, free), $W_\theta$ (same seed, early spatial constraint then released). The anchored frustration score subtracts ordinary seed-to-seed variability from the intervention effect, measured in CLIP-feature space:

$$ F_s(\theta) \;=\; d_s(A_\theta, W_\theta) \;-\; d_s(A_\theta, C_\theta) $$
Three matched rollouts per checkpoint: A free, C different-seed free, W early constraint then released.
Optimized checkpoint · constrained-then-released rollout diverges from the free baseline.

MSPD-optimized checkpoints show larger $A \leftrightarrow W$ gaps than matched random controls — directional evidence on both substrates.

  • Flow-Lenia: 7/9 matched groups positive, sign-test $p = 0.090$
  • Particle Life++: 6/7 matched groups positive, sign-test $p = 0.063$

Neither result reaches conventional significance — read as underpowered evidence of history dependence rather than confirmed effect. The natural strengthening is replication with a larger matched-group ensemble, without methodological change.

C6 · One construction, three substrates

The MSPD construction applies uniformly across substrates that expose meaningful local transition laws — categorical for cellular automata, displacement for particle systems, tracer motions for Flow-Lenia. The recipe doesn't change.

Flow-Lenia · continuous mass flow
Cellular automata · discrete cells
Particle Life++ · neural particles

Where the evidence stands

Claim Life-CA Flow-Lenia Particle Life++
C1 · MSPD-optimized $>$ random ✓ rule sweep ~ 6/9, p=0.25 ✓ 7/7, p=0.008
C2 · High $\Delta H$ marks branch points ✓ ✓ Spearman 0.62 —
C5 · Scale-dependent frustration — ~ 7/9, p=0.09 ~ 6/7, p=0.06

✓ confirmed  ·  ~ directional / underpowered  ·  — not run. C5 on Life-CA is straightforward to add; C2 on Particle Life++ is conceptually obstructed by the deep-attractor structure of the substrate (see paper §5.4).

Limitations and next steps

We are honest about what the current evidence supports and what it doesn't. The paper's §6 limitations cover within-window stationarity, statistical power on C1/C5, sensitivity of C5 to the intervention protocol, and the incomplete 3×3 claim-substrate matrix.

Three follow-up directions are deferred to the next version of this work:

  • Head-to-head vs NN-OEE drivers — run $D_P$-driven evolution against ASAL and Leniabreeder on a shared task, to test whether an interpretable formula matches the empirical performance of black-box judges.
  • Multi-objective with snapshot-MSSC — combine the temporal $D_P$ with the original spatial MSSC, since biological complexity is both temporally reorganizing and spatially hierarchical.
  • Scale-separation timescale $\tau^*$ — system-identify the characteristic time at which within-pattern dynamics separate from between-pattern evolution; the temporal analog of an RG fixed-point scale.

BibTeX

@article{akhtyrchenko_mspd_2026,
  author        = {Akhtyrchenko, Mikhail and
                   Katsnelson, Mikhail I. and
                   Ustyuzhanin, Andrey},
  title         = {{Directing Open-Ended Evolution in Artificial
                    Life via Multi-Scale Path Divergence}},
  year          = {2026},
  eprint        = {2606.17091},
  archivePrefix = {arXiv},
  url           = {https://arxiv.org/abs/2606.17091}
}