AutomataGPT: Forecasting and Ruleset Inference for Two-Dimensional Cellular Automata

• URL: http://arxiv.org/abs/2506.17333v1
• Date: Thu, 19 Jun 2025 05:54:08 GMT
• Title: AutomataGPT: Forecasting and Ruleset Inference for Two-Dimensional Cellular Automata
• Authors: Jaime A. Berkovich, Noah S. David, Markus J. Buehler,
• Abstract summary: We present AutomataPT, a decoder-only transformer pretrained on around 1 million simulated trajectories.<n>It reconstructs the governing update rule with up to 96% functional (application) accuracy and 82% exact rule-matrix match.<n>By showing that transformer models can faithfully infer and execute CA dynamics from data alone, our work lays the groundwork for abstracting real-world dynamical phenomena into data-efficient CA surrogates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However, automatically discovering the local update rules for a given phenomenon and using them for quantitative prediction remains challenging. Here we present AutomataGPT, a decoder-only transformer pretrained on around 1 million simulated trajectories that span 100 distinct two-dimensional binary deterministic CA rules on toroidal grids. When evaluated on previously unseen rules drawn from the same CA family, AutomataGPT attains 98.5% perfect one-step forecasts and reconstructs the governing update rule with up to 96% functional (application) accuracy and 82% exact rule-matrix match. These results demonstrate that large-scale pretraining over wider regions of rule space yields substantial generalization in both the forward (state forecasting) and inverse (rule inference) problems, without hand-crafted priors. By showing that transformer models can faithfully infer and execute CA dynamics from data alone, our work lays the groundwork for abstracting real-world dynamical phenomena into data-efficient CA surrogates, opening avenues in biology, tissue engineering, physics and AI-driven scientific discovery.

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)
• DyTTP: Trajectory Prediction with Normalization-Free Transformers [0.0]
  Transformer-based architectures have demonstrated significant promise in capturing complex robustnessity dependencies.<n>We present a two-fold approach to address these challenges.<n>First, we integrate DynamicTanh (DyT), which is the latest method to promote transformers, into the backbone, replacing traditional layer normalization.<n>We are the first work to deploy the DyT to the trajectory prediction task.
  arXiv  Detail & Related papers  (2025-04-07T09:26:25Z)
• Learning Elementary Cellular Automata with Transformers [3.7013865226473848]
  We show that Transformers can learn to abstract and generalize the rules governing Elementary Cellular Automata.<n>Our analysis reveals that including future states or rule prediction in the training loss enhances the models' ability to form internal representations of the rules.
  arXiv  Detail & Related papers  (2024-12-02T11:57:49Z)
• LifeGPT: Topology-Agnostic Generative Pretrained Transformer Model for Cellular Automata [0.0]
  We show that a decoder-only generative pretrained transformer (GPT) model can simulate Conway's Game of Life (Life) on a toroidal grid with no prior knowledge on the size of the grid. Our results pave the path towards true universal computation within a large language model framework.
  arXiv  Detail & Related papers  (2024-09-03T11:43:16Z)
• Planning with Adaptive World Models for Autonomous Driving [50.4439896514353]
  We present nuPlan, a real-world motion planning benchmark that captures multi-agent interactions.<n>We learn to model such unique behaviors with BehaviorNet, a graph convolutional neural network (GCNN)<n>We also present AdaptiveDriver, a model-predictive control (MPC) based planner that unrolls different world models conditioned on BehaviorNet's predictions.
  arXiv  Detail & Related papers  (2024-06-15T18:53:45Z)
• 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)
• One-Shot Domain Adaptive and Generalizable Semantic Segmentation with Class-Aware Cross-Domain Transformers [96.51828911883456]
  Unsupervised sim-to-real domain adaptation (UDA) for semantic segmentation aims to improve the real-world test performance of a model trained on simulated data. Traditional UDA often assumes that there are abundant unlabeled real-world data samples available during training for the adaptation. We explore the one-shot unsupervised sim-to-real domain adaptation (OSUDA) and generalization problem, where only one real-world data sample is available.
  arXiv  Detail & Related papers  (2022-12-14T15:54:15Z)
• Automatic Rule Induction for Efficient Semi-Supervised Learning [56.91428251227253]
  Semi-supervised learning has shown promise in allowing NLP models to generalize from small amounts of labeled data. Pretrained transformer models act as black-box correlation engines that are difficult to explain and sometimes behave unreliably. We propose tackling both of these challenges via Automatic Rule Induction (ARI), a simple and general-purpose framework.
  arXiv  Detail & Related papers  (2022-05-18T16:50:20Z)
• Towards self-organized control: Using neural cellular automata to robustly control a cart-pole agent [62.997667081978825]
  We use neural cellular automata to control a cart-pole agent. We trained the model using deep-Q learning, where the states of the output cells were used as the Q-value estimates to be optimized.
  arXiv  Detail & Related papers  (2021-06-29T10:49:42Z)
• TELESTO: A Graph Neural Network Model for Anomaly Classification in Cloud Services [77.454688257702]
  Machine learning (ML) and artificial intelligence (AI) are applied on IT system operation and maintenance. One direction aims at the recognition of re-occurring anomaly types to enable remediation automation. We propose a method that is invariant to dimensionality changes of given data.
  arXiv  Detail & Related papers  (2021-02-25T14:24:49Z)
• Understanding Self-Training for Gradual Domain Adaptation [107.37869221297687]
  We consider gradual domain adaptation, where the goal is to adapt an initial classifier trained on a source domain given only unlabeled data that shifts gradually in distribution towards a target domain. We prove the first non-vacuous upper bound on the error of self-training with gradual shifts, under settings where directly adapting to the target domain can result in unbounded error. The theoretical analysis leads to algorithmic insights, highlighting that regularization and label sharpening are essential even when we have infinite data, and suggesting that self-training works particularly well for shifts with small Wasserstein-infinity distance.
  arXiv  Detail & Related papers  (2020-02-26T08:59:40Z)

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.