Looking for Complexity at Phase Boundaries in Continuous Cellular Automata

Vassilis Papadopoulos, Guilhem Doat, Arthur Renard, Clément Hongler

Abstract

One key challenge in Artificial Life is designing systems that display an emergence of complex behaviors. Many such systems depend on a high-dimensional parameter space, only a small subset of which displays interesting dynamics. Focusing on the case of continuous systems, we introduce the 'Phase Transition Finder'(PTF) algorithm, which can be used to efficiently generate parameters lying at the border between two phases. We argue that such points are more likely to display complex behaviors, and confirm this by applying PTF to Lenia showing it can increase the frequency of interesting behaviors more than two-fold, while remaining efficient enough for large-scale searches.

Introduction: The Search for Emergence

In the quest to create Artificial Life (Alife), researchers often find themselves lost in a "desert" of boring parameters. Most configurations of a complex system lead to either total stillness (extinction) or chaotic noise. Designing systems that exhibit emergent, life-like behaviors—such as self-reproducing "creatures" or stable moving "gliders"—is a central challenge.

Systems like Lenia, a continuous version of the Game of Life, possess massive, high-dimensional parameter spaces. In multi-channel Lenia, there are over 100 real-valued parameters to tune. The "Goldilocks zone" where interesting dynamics happen is incredibly small. Traditional methods to find these zones, such as genetic algorithms or gradient descent, are computationally expensive and often require a specific goal or fitness function. This research proposes a clever shortcut: if you want to find the "interesting" stuff, look exactly where the system is about to undergo a phase transition.

The Phase Transition Finder (PTF)

The authors introduce the Phase Transition Finder (PTF), a lightweight algorithm that identifies parameters at the boundary between different system states (e.g., "dead" vs. "alive"). The core intuition, drawn from statistical physics, is that complexity often emerges at the "edge of chaos" or phase boundaries.

The PTF algorithm operates through a simple four-step process:

  1. Define Phases: Two mutually exclusive phases are defined. In Lenia, these are typically "dead" (average cell activation falls below a threshold) and "living" (any other state).
  2. Sample and Connect: Parameters are randomly sampled until two points belonging to different phases are found.
  3. Dichotomy (Binary Search): A path is drawn between these two points in parameter space. The algorithm then uses a binary search (dichotomy) to find the precise point where the system transitions from one phase to the other.
  4. Efficiency Optimization: To maintain speed, initial phase-checking simulations are run on a tiny 5x5 grid for a short duration. The resulting "transition parameters" are then validated on a larger toroidal world.
The PTF algorithm performs a binary search along a path connecting two distinct phases in parameter space to locate the transition boundary.

Experimental Evaluation

The researchers evaluated PTF using the multi-channel Lenia framework. They tested the algorithm against two different "priors" (starting ranges for parameters):

  • Neutral Prior: Parameters generated uniformly across a broad range.
  • Smart Prior: A constrained range where the "ground state" is mathematically likely to be unstable, ensuring a better balance between dead and alive phases.

The results showed a significant "boost" in the discovery of interesting behaviors. Using a "smart" prior, random sampling yielded interesting dynamics 14.0% of the time. Applying PTF to that same prior jumped the success rate to 30.5%, more than doubling the frequency of discovery.

Key Insights and Results

Beyond the quantitative yield increase, the study provided several qualitative insights:

  • Phase Transitions as a Proxy for Complexity: The boundary between "nothing happens" and "everything happens" is mathematically predisposed to scale invariance and non-trivial emergent structures.
  • Computational Efficiency: The algorithm is remarkably fast, generating 100 phase transition points in approximately 4 minutes and 20 seconds on a single RTX 3080 GPU.
  • Emergent Mitosis: The authors observed that self-reproduction (solitons splitting into two) is a common occurrence at these phase boundaries, suggesting that mitosis might be a fundamental feature of transition regions in Lenia.
  • Diversity of Behaviors: The method successfully discovered a wide variety of "creatures," including solitons, gliders, and complex multi-colored interacting structures that are rarely seen in random searches.
A grid of diverse emergent behaviors discovered by the PTF algorithm in multi-channel Lenia, showcasing the variety of life-like structures found at phase boundaries.

Limitations and Future Outlook

While effective, PTF has limitations. It still requires a human-defined "prior" region; if the prior lacks a phase boundary, the algorithm cannot function. Additionally, some boundaries are "soft," leading to "critical slowing down" where the system takes a long time to die without producing interesting structures. Currently, PTF cannot distinguish these from "sharp" transitions that produce gliders.

The authors suggest that the main barrier to using Deep Learning for Alife is the low "signal-to-noise" ratio of interesting behaviors in random data. PTF acts as a high-quality filter to create better datasets for future machine learning models. Future work involves automating "interestingness" detection and applying PTF to other systems, such as Flow-Lenia, where mass is conserved and the definition of "dead" must be reimagined.

Summary updated

Abstract

One key challenge in Artificial Life is designing systems that display an emergence of complex behaviors. Many such systems depend on a high-dimensional parameter space, only a small subset of which displays interesting dynamics. Focusing on the case of continuous systems, we introduce the 'Phase Transition Finder'(PTF) algorithm, which can be used to efficiently generate parameters lying at the border between two phases. We argue that such points are more likely to display complex behaviors, and confirm this by applying PTF to Lenia showing it can increase the frequency of interesting behaviors more than two-fold, while remaining efficient enough for large-scale searches.
BibTeX
@inproceedings{papadopoulos2024looking,
  author = {Vassilis Papadopoulos and Guilhem Doat and Arthur Renard and Clément Hongler},
  title = {{Looking for Complexity at Phase Boundaries in Continuous Cellular Automata}},
  booktitle = {GECCO Companion},
  year = {2024},
  doi = {10.1145/3638530.3654420},
}

Loading related content...

Figure