Search arXiv⌕ Search

arXiv subjects

Benedikt Hartl

Publications and source records attributed to Benedikt Hartl.

17 recordsLinked to original sources

On Growth and Form, and Function: Reusable Regulatory Handles Control Phenotypic Variation

How phenotypic transformations are implemented by changes in underlying regulatory dynamics remains a central question in developmental biology. Inspired by D'Arcy Thompson's 1917 "On Growth and Form", we ask whether coherent large-scale transformations of morphology can be encoded as low-dimensional modulations of a self-organizing developmental system. We use neural cellular automata (NCAs) as bio-inspired models of distributed development, in which a shared local regulatory network grows target morphologies from a single cell. We apply low-rank adaptation (LoRA) to pretrained NCAs, representing each adapted developmental program as a low-rank modulation of a fixed regulatory scaffold. Horizontal and vertical scaling of a fully grown 2D emoji phenotype can each be implemented by rank-one adaptations. Their linear combinations parametrically control phenotype size, generalize beyond the training distribution, and compose with target-specific adapters. Strikingly, adaptations learned for one phenotype transfer zero-shot across structurally and semantically diverse phenotypes sharing the same reference scaffold, while largely preserving internal features. This suggests reusable system-level hyper-directions of scale rather than morphology-specific transformations. From approximately 25,000 independently trained phenotype-specific NCA adapters with a shared scaffold, we further identify latent low-dimensional directions that functionally control phenotypic variation including scaling, style, and symmetrical fission. Together, our results provide a computational realization of D'Arcy Thompson's remarkable grid transformations in a 2D NCA---a minimal cybernetic tissue in which variations of fully grown emoji phenotypes can be encoded, combined, and controlled through low-dimensional directions in regulatory weight space.

cs.NE↗

The Artificial Experimentalist: Discovery and Control of Self-Organizing Phenomena with Autotelic Reinforcement Learning

Existing methods for exploring cellular automata and other complex systems mostly operate in open loop: they set initial conditions, execute a full simulation, and observe the outcome, without intervening during execution. We introduce a closed-loop framework based on autotelic reinforcement learning, in which an agent autonomously samples diverse goals and learns a goal-conditioned policy to intervene in a complex system through minimal, local perturbations. We instantiate this framework on Lenia, a continuous cellular automaton known for life-like self-organizing patterns, in an agentic system we call CARL, and demonstrate three capabilities. First, CARL discovers stable solitons across a wide range of Lenia update rules at a higher rate than heuristic baselines. Second, it learns to steer the movement direction of existing solitons with few interventions, showing that CARL can control self-organizing patterns, not only create them. Third, humans can use trained agents to guide solitons through maze environments in real time by specifying high-level directional commands that the agent translates into low-level interventions. Trained across diverse goals, update rules, and random initial states, the agents acquire policies that generalize zero-shot to various out-of-distribution conditions. These results suggest a path toward artificial experimentalist agents that, autonomously or with human guidance, discover and control emergent phenomena in complex systems.

cs.AI↗

Emergent swimming strategies of a smart three-bead swimmer

Low-Reynolds-number microswimmers have recently attracted much interest for their ubiquity in biology and their applications in biotechnology and medicine. However, a key obstacle for the design and deployment of artificial microswimmers lies in their autonomy: to successfully perform tasks in any real-world scenario, these swimmers need to be able to interact with and adapt to their environment without external control. Here, we train a simple two-dimensional model microswimmer (consisting of three-bead) to learn autonomous swimming strategies via Reinforcement Learning, focusing on neuroevolution techniques to derive controller architectures with minimal complexity. We identify five different, characteristic swimming gaits: three of these gaits lead to directed locomotion with varying grades of efficiency and two gaits result in a rotational, inefficient movement. Remarkably, all of these gaits can be achieved by very simple neural networks (with less than ten nodes and weights), showing that low-Reynolds-number swimming can be achieved efficiently and robustly while requiring only minimal computational power. These results are of particular interest to the experimental design of artificial microswimmers and may have implications for modeling biological microorganisms such as Chlamydomonas reinhardtii.

physics.bio-ph↗

Agnosiophobia in a virtual agent: behavioral and dynamical architecture in Lenia

All embodied agents are fundamentally patterns in physiological or other excitable media, blurring the distinction between objects and processes. Emergent patterns with complex behaviors, such as Gliders in the Game of Life and virtual patterns in Lenia, are powerful model systems in which to understand the properties and origins of behavioral traits in novel agents. To evaluate the behavior of patterns in Lenia, we introduce regions into their environment from which no sensory information is available - in effect, making creatures blind to parts of their surroundings. Complementing the conventional concept of infotaxis, we find that creatures tend to avoid these regions, a behavior we term agnosiophobia. To explain this behavior, we map each test creature's sensitivity to targeted occlusions and interpret the results in the language of dynamical systems. We observe Lenia creatures taking advantage of their freedom to change heading in order to achieve what appears to be a more fundamental goal: the preservation of their morphology. This work illustrates the beginning of an important roadmap to understand how emergent agents' behavioral propensities interact with the informational, not only tangible, topography of their world.

nlin.CG↗

Diffusion Models are Evolutionary Algorithms

In a convergence of machine learning and biology, we reveal that diffusion models are evolutionary algorithms. By considering evolution as a denoising process and reversed evolution as diffusion, we mathematically demonstrate that diffusion models inherently perform evolutionary algorithms, naturally encompassing selection, mutation, and reproductive isolation. Building on this equivalence, we propose the Diffusion Evolution method: an evolutionary algorithm utilizing iterative denoising -- as originally introduced in the context of diffusion models -- to heuristically refine solutions in parameter spaces. Unlike traditional approaches, Diffusion Evolution efficiently identifies multiple optimal solutions and outperforms prominent mainstream evolutionary algorithms. Furthermore, leveraging advanced concepts from diffusion models, namely latent space diffusion and accelerated sampling, we introduce Latent Space Diffusion Evolution, which finds solutions for evolutionary tasks in high-dimensional complex parameter space while significantly reducing computational steps. This parallel between diffusion and evolution not only bridges two different fields but also opens new avenues for mutual enhancement, raising questions about open-ended evolution and potentially utilizing non-Gaussian or discrete diffusion models in the context of Diffusion Evolution.

cs.NE↗

A Little Rank Goes a Long Way: Random Scaffolds with LoRA Adapters Are All You Need

How many of a neural network's parameters actually encode task-specific information? We investigate this question with LottaLoRA, a training paradigm in which every backbone weight is drawn at random and frozen; only low-rank LoRA adapters are trained. Across nine benchmarks spanning diverse architecture families from single-layer classifiers to 900M parameter Transformers low-rank adapters over frozen random backbones recover 96-100% of fully trained performance while training only 0.5-40% of the parameters. The task-specific signal therefore occupies a subspace orders of magnitude smaller than the full parameter count suggests. Three mechanistic findings underpin this result:(1) the frozen backbone is actively exploited when static the learned scaling~$β$ remains strictly positive across all architectures but when the scaffold is destabilized, the optimizer silences it and the LoRA factors absorb all task information; (2) the frozen backbone is preferable but interchangeable any random initialization works equally well, provided it remains fixed throughout training; and (3) the minimum LoRA rank at which performance saturates estimates the intrinsic dimensionality of the task, reminiscent of the number of components retained in Principal Component Analysis (PCA). The construction is formally analogous to Reservoir Computing unfolded along the depth axis of a feedforward network. Because the backbone is determined by a random seed alone, models can be distributed as adapters plus seed a footprint that grows with task complexity, not model size, so that storage and memory savings compound as architectures scale.

cs.LG↗

BraiNCA: brain-inspired neural cellular automata and applications to morphogenesis and motor control

Most of the Neural Cellular Automata (NCAs) defined in the literature have a common theme: they are based on regular grids with a Moore neighborhood (one-hop neighbour). They do not take into account long-range connections and more complex topologies as we can find in the brain. In this paper, we introduce BraiNCA, a brain-inspired NCA with an attention layer, long-range connections and complex topology. BraiNCAs shows better results in terms of robustness and speed of learning on the two tasks compared to Vanilla NCAs establishing that incorporating attention-based message selection together with explicit long-range edges can yield more sample-efficient and damage-tolerant self-organization than purely local, grid-based update rules. These results support the hypothesis that, for tasks requiring distributed coordination over extended spatial and temporal scales, the choice of interaction topology and the ability to dynamically route information will impact the robustness and speed of learning of an NCA. More broadly, BraiNCA provides brain-inspired NCA formulation that preserves the decentralized local update principle while better reflecting non-local connectivity patterns, making it a promising substrate for studying collective computation under biologically-realistic network structure and evolving cognitive substrates.

cs.AI↗

Evolving Symbiosis, from Barricelli's Legacy to Collective Intelligence: a simulated and conceptual approach

This report documents the work of our group (named SymBa) at the ALICE 2026 workshop in Copenhagen. Inspired by the pioneering work by Nils Aall Barricelli on symbiogenesis of numerical organisms (i.e., 1D cellular automata) in 1953 (70+ years ago!!), we discussed the role of symbiogenesis as mechanism contributing to the origins of life, open-endedness, and collective intelligence. We report replications of Barricelli's original work in 1D worlds, an extension to 2D symbioorganisms, and preliminary experimentation with DNA-norms. We discuss the implications of symbiogenesis for artifical life and artificial intelligence, and outline several opportunities for future works, both at the conceptual level as well as using different substrates (neural networks, neural cellular automata, etc.)

cs.NE↗

Remapping and navigation of an embedding space via error minimization: a fundamental organizational principle of cognition in natural and artificial systems

The emerging field of diverse intelligence seeks an integrated view of problem-solving in agents of very different provenance, composition, and substrates. From subcellular chemical networks to swarms of organisms, and across evolved, engineered, and chimeric systems, it is hypothesized that scale-invariant principles of decision-making can be discovered. We propose that cognition in both natural and synthetic systems can be characterized and understood by the interplay between two equally important invariants: (1) the remapping of embedding spaces, and (2) the navigation within these spaces. Biological collectives, from single cells to entire organisms (and beyond), remap transcriptional, morphological, physiological, or 3D spaces to maintain homeostasis and regenerate structure, while navigating these spaces through distributed error correction. Modern Artificial Intelligence (AI) systems, including transformers, diffusion models, and neural cellular automata enact analogous processes by remapping data into latent embeddings and refining them iteratively through contextualization. We argue that this dual principle - remapping and navigation of embedding spaces via iterative error minimization - constitutes a substrate-independent invariant of cognition. Recognizing this shared mechanism not only illuminates deep parallels between living systems and artificial models, but also provides a unifying framework for engineering adaptive intelligence across scales.

cs.AI↗

Neural cellular automata: applications to biology and beyond classical AI

Neural Cellular Automata (NCA) represent a powerful framework for modeling biological self-organization, extending classical rule-based systems with trainable, differentiable (or evolvable) update rules that capture the adaptive self-regulatory dynamics of living matter. By embedding Artificial Neural Networks (ANNs) as local decision-making centers and interaction rules between localized agents, NCA can simulate processes across molecular, cellular, tissue, and system-level scales, offering a multiscale competency architecture perspective on evolution, development, regeneration, aging, morphogenesis, and robotic control. These models not only reproduce biologically inspired target patterns but also generalize to novel conditions, demonstrating robustness to perturbations and the capacity for open-ended adaptation and reasoning. Given their immense success in recent developments, we here review current literature of NCAs that are relevant primarily for biological or bioengineering applications. Moreover, we emphasize that beyond biology, NCAs display robust and generalizing goal-directed dynamics without centralized control, e.g., in controlling or regenerating composite robotic morphologies or even on cutting-edge reasoning tasks such as ARC-AGI-1. In addition, the same principles of iterative state-refinement is reminiscent to modern generative Artificial Intelligence (AI), such as probabilistic diffusion models. Their governing self-regulatory behavior is constraint to fully localized interactions, yet their collective behavior scales into coordinated system-level outcomes. We thus argue that NCAs constitute a unifying computationally lean paradigm that not only bridges fundamental insights from multiscale biology with modern generative AI, but have the potential to design truly bio-inspired collective intelligence capable of hierarchical reasoning and control.

cs.AI↗

Heuristically Adaptive Diffusion-Model Evolutionary Strategy

Diffusion Models represent a significant advancement in generative modeling, employing a dual-phase process that first degrades domain-specific information via Gaussian noise and restores it through a trainable model. This framework enables pure noise-to-data generation and modular reconstruction of, images or videos. Concurrently, evolutionary algorithms employ optimization methods inspired by biological principles to refine sets of numerical parameters encoding potential solutions to rugged objective functions. Our research reveals a fundamental connection between diffusion models and evolutionary algorithms through their shared underlying generative mechanisms: both methods generate high-quality samples via iterative refinement on random initial distributions. By employing deep learning-based diffusion models as generative models across diverse evolutionary tasks and iteratively refining diffusion models with heuristically acquired databases, we can iteratively sample potentially better-adapted offspring parameters, integrating them into successive generations of the diffusion model. This approach achieves efficient convergence toward high-fitness parameters while maintaining explorative diversity. Diffusion models introduce enhanced memory capabilities into evolutionary algorithms, retaining historical information across generations and leveraging subtle data correlations to generate refined samples. We elevate evolutionary algorithms from procedures with shallow heuristics to frameworks with deep memory. By deploying classifier-free guidance for conditional sampling at the parameter level, we achieve precise control over evolutionary search dynamics to further specific genotypical, phenotypical, or population-wide traits. Our framework marks a major heuristic and algorithmic transition, offering increased flexibility, precision, and control in evolutionary optimization processes.

cs.NE↗

Neuroevolution of Decentralized Decision-Making in N-Bead Swimmers Leads to Scalable and Robust Collective Locomotion

Many microorganisms swim by performing larger non-reciprocal shape deformations that are initiated locally by molecular motors. However, it remains unclear how decentralized shape control determines the movement of the entire organism. Here, we investigate how efficient locomotion emerges from coordinated yet simple and decentralized decision-making of the body parts using neuroevolution techniques. Our approach allows us to investigate optimal locomotion policies for increasingly large microswimmer bodies, with emerging long-wavelength body shape deformations corresponding to surprisingly efficient swimming gaits. The obtained decentralized policies are robust and tolerant concerning morphological changes or defects and can be applied to artificial microswimmers for cargo transport or drug delivery applications without further optimization "out of the box". Our work is of relevance to understanding and developing robust navigation strategies of biological and artificial microswimmers and, in a broader context, for understanding emergent levels of individuality and the role of collective intelligence in Artificial Life.

physics.bio-ph↗

Ordered ground state configurations of the asymmetric Wigner bilayer system -- revisited: an unsupervised clustering algorithm analysis

We have re-analysed the rich plethora of ground state configurations of the asymmetric Wigner bilayer system that we had recently published in a related diagram of states [M. Antlanger \textit{et al.}, Phys. Rev. Lett. \textbf{117}, 118002 (2016)], comprising roughly 60~000 state points in the phase space spanned by the distance between the plates and the charge asymmetry parameter of the system. In contrast to this preceding contribution where the classification of the emerging structures was carried out ``by hand'', we have used this time machine learning concepts, notably based on a principal component analysis and a $k$-means clustering approach: using a 30-dimensional feature vector for each emerging structure (containing relevant information, such as the composition of the configuration as well as the most relevant order parameters) we were able to re-analyse these ground state configurations in a considerably more systematic and comprehensive manner than we could possibly do in the previously published classification scheme. Indeed we were now able to identify new structures in previously unclassified regions of the parameter space and could considerably refine the previous classification scheme, identifying thereby a rich wealth of new emerging ground state configurations. Thorough consistency checks confirm the validity of the newly defined diagram of states.

cond-mat.soft↗

Microswimmers learning chemotaxis with genetic algorithms

Various microorganisms and some mammalian cells are able to swim in viscous fluids by performing nonreciprocal body deformations, such as rotating attached flagella or by distorting their entire body. In order to perform chemotaxis, i.e. to move towards and to stay at high concentrations of nutrients, they adapt their swimming gaits in a nontrivial manner. We propose a model how microswimmers are able to autonomously adapt their shape in order to swim in one dimension towards high field concentrations using an internal decision making machinery modeled by an artificial neural network. We present two methods to measure chemical gradients, spatial and temporal sensing, as known for swimming mammalian cells and bacteria, respectively. Using the NEAT genetic algorithm surprisingly simple neural networks evolve which control the shape deformations of the microswimmer and allow them to navigate in static and complex time-dependent chemical environments. By introducing noisy signal transmission in the neural network the well-known biased run-and-tumble motion emerges. Our work demonstrates that the evolution of a simple internal decision-making machinery, which we can fully interpret and is coupled to the environment, allows navigation in diverse chemical landscapes. These findings are of relevance for intracellular biochemical sensing mechanisms of single cells, or for the simple nervous system of small multicellular organisms such as C. elegans.

physics.bio-ph↗

Reliable computational prediction of supramolecular ordering of complex molecules under electrochemical conditions

We propose a computationally lean, two-stage approach that reliably predicts self-assembly behavior of complex charged molecules on a metallic surfaces under electrochemical conditions. Stage one uses ab initio simulations to provide reference data for the energies (evaluated for archetypical configurations) to fit the parameters of a conceptually much simpler and computationally less expensive model of the molecules: classical, spherical particles, representing the respective atomic entities, a soft but perfectly conductive wall potential represents the metallic surface. Stage two feeds the energies that emerge from this classical model into highly efficient and reliable optimization techniques to identify via energy minimization the ordered ground state configurations of the molecules. We demonstrate the power of our approach by successfully reproducing, on a semi-quantitative level, the intricate supramolecular ordering observed experimentally for PQP$^+$ and ClO$_4^-$ molecules at an Au(111)-electrolyte interface, including the formation of open-porous, self-hosts--guest, and stratified bilayer phases as a function of the electric field at the solid--liquid interface. We also discuss the role of the perchlorate ions in the self-assembly process, whose positions could not be identified in the related experimental investigations.

physics.comp-ph↗

Optimal control of non-Markovian dynamics in a single-mode cavity strongly coupled to an inhomogeneously broadened spin ensemble

Ensembles of quantum mechanical spins offer a promising platform for quantum memories, but proper functionality requires accurate control of unavoidable system imperfections. We present an efficient control scheme for a spin ensemble strongly coupled to a single-mode cavity based on a set of Volterra equations relying solely on weak classical control pulses. The viability of our approach is demonstrated in terms of explicit storage and readout sequences that will serve as a starting point towards the realization of more demanding full quantum mechanical optimal control schemes.

quant-ph↗

Hybrid Quantum Systems with Collectively Coupled Spin States: Suppression of Decoherence through Spectral Hole Burning

Spin ensemble based hybrid quantum systems suffer from a significant degree of decoherence resulting from the inhomogeneous broadening of the spin transition frequencies in the ensemble. We demonstrate that this strongly restrictive drawback can be overcome simply by burning two narrow spectral holes in the spin spectral density at judiciously chosen frequencies. Using this procedure we find an increase of the coherence time by more than an order of magnitude as compared to the case without hole burning. Our findings pave the way for the practical use of these hybrid quantum systems for the processing of quantum information.

quant-ph↗