Differentiable Logic Cellular Automata: From Game of Life to Pattern Generation

• URL: http://arxiv.org/abs/2506.04912v1
• Date: Thu, 05 Jun 2025 11:45:43 GMT
• Title: Differentiable Logic Cellular Automata: From Game of Life to Pattern Generation
• Authors: Pietro Miotti, Eyvind Niklasson, Ettore Randazzo, Alexander Mordvintsev,
• Abstract summary: This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA)<n>It is a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs)
• Score: 41.09791239221661
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are differentiable logic gates, combined into a circuit. During training, the model is fully end-to-end differentiable allowing gradient-based training, and at inference time it operates in a fully discrete state space. This enables learning local update rules for cellular automata while preserving their inherent discrete nature. We demonstrate the versatility of our approach through a series of milestones: (1) fully learning the rules of Conway's Game of Life, (2) generating checkerboard patterns that exhibit resilience to noise and damage, (3) growing a lizard shape, and (4) multi-color pattern generation. Our model successfully learns recurrent circuits capable of generating desired target patterns. For simpler patterns, we observe success with both synchronous and asynchronous updates, demonstrating significant generalization capabilities and robustness to perturbations. We make the case that this combination of DLGNs and NCA represents a step toward programmable matter and robust computing systems that combine binary logic, neural network adaptability, and localized processing. This work, to the best of our knowledge, is the first successful application of differentiable logic gate networks in recurrent architectures.

Related papers

• A Path to Universal Neural Cellular Automata [6.7822488410082755]
  This work explores the potential of neural cellular automata to develop a continuous Universal Cellular Automaton.<n>We introduce a cellular automaton model, objective functions and training strategies to guide neural cellular automata toward universal computation in a continuous setting.
  arXiv  Detail & Related papers  (2025-05-19T12:46:01Z)
• Convolutional Differentiable Logic Gate Networks [68.74313756770123]
  We propose an approach for learning logic gate networks directly via a differentiable relaxation. We build on this idea, extending it by deep logic gate tree convolutions and logical OR pooling. On CIFAR-10, we achieve an accuracy of 86.29% using only 61 million logic gates, which improves over the SOTA while being 29x smaller.
  arXiv  Detail & Related papers  (2024-11-07T14:12:00Z)
• Learning spatio-temporal patterns with Neural Cellular Automata [0.0]
  We train NCA to learn complex dynamics from time series of images and PDE trajectories. We extend NCA to capture both transient and stable structures within the same system. Being able to learn arbitrary dynamics gives NCA great potential as a data driven modelling framework.
  arXiv  Detail & Related papers  (2023-10-23T11:16:32Z)
• Locally adaptive cellular automata for goal-oriented self-organization [14.059479351946386]
  We propose a new model class of adaptive cellular automata that allows for the generation of scalable and expressive models. We show how to implement adaptation by coupling the update rule of the cellular automaton with itself and the system state in a localized way.
  arXiv  Detail & Related papers  (2023-06-12T12:32:23Z)
• How neural networks learn to classify chaotic time series [77.34726150561087]
  We study the inner workings of neural networks trained to classify regular-versus-chaotic time series. We find that the relation between input periodicity and activation periodicity is key for the performance of LKCNN models.
  arXiv  Detail & Related papers  (2023-06-04T08:53:27Z)
• Pathfinding Neural Cellular Automata [23.831530224401575]
  Pathfinding is an important sub-component of a broad range of complex AI tasks, such as robot path planning, transport routing, and game playing. We hand-code and learn models for Breadth-First Search (BFS), i.e. shortest path finding. We present a neural implementation of Depth-First Search (DFS), and outline how it can be combined with neural BFS to produce an NCA for computing diameter of a graph. We experiment with architectural modifications inspired by these hand-coded NCAs, training networks from scratch to solve the diameter problem on grid mazes while exhibiting strong ability generalization
  arXiv  Detail & Related papers  (2023-01-17T11:45:51Z)
• Pretraining Graph Neural Networks for few-shot Analog Circuit Modeling and Design [68.1682448368636]
  We present a supervised pretraining approach to learn circuit representations that can be adapted to new unseen topologies or unseen prediction tasks. To cope with the variable topological structure of different circuits we describe each circuit as a graph and use graph neural networks (GNNs) to learn node embeddings. We show that pretraining GNNs on prediction of output node voltages can encourage learning representations that can be adapted to new unseen topologies or prediction of new circuit level properties.
  arXiv  Detail & Related papers  (2022-03-29T21:18:47Z)
• Neural Cellular Automata Manifold [84.08170531451006]
  We show that the neural network architecture of the Neural Cellular Automata can be encapsulated in a larger NN. This allows us to propose a new model that encodes a manifold of NCA, each of them capable of generating a distinct image. In biological terms, our approach would play the role of the transcription factors, modulating the mapping of genes into specific proteins that drive cellular differentiation.
  arXiv  Detail & Related papers  (2020-06-22T11:41:57Z)
• Evaluating Logical Generalization in Graph Neural Networks [59.70452462833374]
  We study the task of logical generalization using graph neural networks (GNNs) Our benchmark suite, GraphLog, requires that learning algorithms perform rule induction in different synthetic logics. We find that the ability for models to generalize and adapt is strongly determined by the diversity of the logical rules they encounter during training.
  arXiv  Detail & Related papers  (2020-03-14T05:45:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.