Learning Graph Cellular Automata

• URL: http://arxiv.org/abs/2110.14237v1
• Date: Wed, 27 Oct 2021 07:42:48 GMT
• Title: Learning Graph Cellular Automata
• Authors: Daniele Grattarola, Lorenzo Livi, Cesare Alippi
• Abstract summary: We focus on a generalised version of typical cellular automata (GCA) In particular, we extend previous work that used convolutional neural networks to learn the transition rule of conventional GCA. We show that it can represent any arbitrary GCA with finite and discrete state space.
• Score: 25.520299226767946
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph cellular automata (GCA), in which the lattice structure is replaced by an arbitrary graph. In particular, we extend previous work that used convolutional neural networks to learn the transition rule of conventional CA and we use graph neural networks to learn a variety of transition rules for GCA. First, we present a general-purpose architecture for learning GCA, and we show that it can represent any arbitrary GCA with finite and discrete state space. Then, we test our approach on three different tasks: 1) learning the transition rule of a GCA on a Voronoi tessellation; 2) imitating the behaviour of a group of flocking agents; 3) learning a rule that converges to a desired target state.

Related papers

• Convolutional Neural Networks for Automated Cellular Automaton Classification [0.0]
  We implement computer vision techniques to perform an automated classification of elementary cellular automata into the five Li-Packard classes. We first show that previously developed deep learning approaches have in fact been trained to identify the local update rule. We then present a convolutional neural network that performs nearly perfectly at identifying the behavioural class.
  arXiv  Detail & Related papers  (2024-09-04T14:21:00Z)
• Cell Graph Transformer for Nuclei Classification [78.47566396839628]
  We develop a cell graph transformer (CGT) that treats nodes and edges as input tokens to enable learnable adjacency and information exchange among all nodes. Poorly features can lead to noisy self-attention scores and inferior convergence. We propose a novel topology-aware pretraining method that leverages a graph convolutional network (GCN) to learn a feature extractor.
  arXiv  Detail & Related papers  (2024-02-20T12:01:30Z)
• From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited [51.24526202984846]
  Graph-based semi-supervised learning (GSSL) has long been a hot research topic. graph convolutional networks (GCNs) have become the predominant techniques for their promising performance.
  arXiv  Detail & Related papers  (2023-09-24T10:10:21Z)
• E(n)-equivariant Graph Neural Cellular Automata [4.168157981135698]
  We propose a class of isotropic automata that we call E(n)-GNCAs. These models are lightweight, but can nevertheless handle large graphs, capture complex dynamics and exhibit emergent self-organising behaviours. We showcase the broad and successful applicability of E(n)-GNCAs on three different tasks.
  arXiv  Detail & Related papers  (2023-01-25T10:17:07Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• A Variational Edge Partition Model for Supervised Graph Representation Learning [51.30365677476971]
  This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities. We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs. A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
  arXiv  Detail & Related papers  (2022-02-07T14:37:50Z)
• Generalization over different cellular automata rules learned by a deep feed-forward neural network [0.0]
  A deep convolutional encoder-decoder network with short and long range skip connections is trained on various generated trajectories to predict the next CA state. Results show that the network is able to learn the rules of various, complex cellular automata and generalize to unseen configurations.
  arXiv  Detail & Related papers  (2021-03-27T12:12:07Z)
• Class-wise Dynamic Graph Convolution for Semantic Segmentation [63.08061813253613]
  We propose a class-wise dynamic graph convolution (CDGC) module to adaptively propagate information. We also introduce the Class-wise Dynamic Graph Convolution Network(CDGCNet), which consists of two main parts including the CDGC module and a basic segmentation network. We conduct extensive experiments on three popular semantic segmentation benchmarks including Cityscapes, PASCAL VOC 2012 and COCO Stuff.
  arXiv  Detail & Related papers  (2020-07-19T15:26:50Z)
• Connecting Graph Convolutional Networks and Graph-Regularized PCA [23.592657600394215]
  Graph convolution operator of the GCN model is originally motivated from a localized first-order approximation of spectral graph convolutions. We establish a textitmathematical connection between graph convolution and graph-regularized PCA (GPCA)
  arXiv  Detail & Related papers  (2020-06-22T14:27:02Z)
• Infinitely Wide Graph Convolutional Networks: Semi-supervised Learning via Gaussian Processes [144.6048446370369]
  Graph convolutional neural networks(GCNs) have recently demonstrated promising results on graph-based semi-supervised classification. We propose a GP regression model via GCNs(GPGC) for graph-based semi-supervised learning. We conduct extensive experiments to evaluate GPGC and demonstrate that it outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-02-26T10:02:32Z)

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.