Generalization over different cellular automata rules learned by a deep feed-forward neural network
To test generalization ability of a class of deep neural networks, we randomly generate a large number of different rule sets for 2-D cellular automata (CA), based on John Conway's Game of Life. Using these rules, we compute several trajectories for each CA instance. A deep convolutional encoder-decoder network with short and long range skip connections is trained on various generated CA trajectories to predict the next CA state given its previous states. Results show that the network is able to learn the rules of various, complex cellular automata and generalize to unseen configurations. To some extent, the network shows generalization to rule sets and neighborhood sizes that were not seen during the training at all. Code to reproduce the experiments is publicly available at: https://github.com/SLAMPAI/generalization-cellular-automata
Code (1)
Tasks
DecoderSimilar Papers 제목 키워드 기반
Human Gait State Prediction Using Cellular Automata and Classification Using ELM
In this research article, we have reported periodic cellular automata rules for different gait state prediction and classification of the gait data using extreme machine Leaning (ELM). This research is the first attempt …
Differentiable Logic Cellular Automata: From Game of Life to Pattern Generation
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…
An Efficient Edge Detection Technique by Two Dimensional Rectangular Cellular Automata
This paper proposes a new pattern of two dimensional cellular automata linear rules that are used for efficient edge detection of an image. Since cellular automata is inherently parallel in nature, it has produced desire…
Edge DetectionVocal Bursts Valence PredictionA continuous-state cellular automata algorithm for global optimization
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global opti…
global-optimizationAutomataGPT: Forecasting and Ruleset Inference for Two-Dimensional Cellular Automata
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 gr…
scientific discovery