Generalization over different cellular automata rules learned by a deep feed-forward neural network

03/27/2021
by   Marcel Aach, et al.
0

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.

READ FULL TEXT
research
12/03/2020

Reconstructing cellular automata rules from observations at nonconsecutive times

Recent experiments by Springer and Kenyon have shown that a deep neural ...
research
10/27/2021

Learning Graph Cellular Automata

Cellular automata (CA) are a class of computational models that exhibit ...
research
01/17/2023

Pathfinding Neural Cellular Automata

Pathfinding makes up an important sub-component of a broad range of comp...
research
09/22/2014

Neighborhood Selection and Rules Identification for Cellular Automata: A Rough Sets Approach

In this paper a method is proposed which uses data mining techniques bas...
research
09/20/2020

Predicting Geographic Information with Neural Cellular Automata

This paper presents a novel framework using neural cellular automata (NC...
research
11/02/2022

Attention-based Neural Cellular Automata

Recent extensions of Cellular Automata (CA) have incorporated key ideas ...

Please sign up or login with your details

Forgot password? Click here to reset