Visualizing computation in large-scale cellular automata

• URL: http://arxiv.org/abs/2104.01008v1
• Date: Thu, 1 Apr 2021 08:14:15 GMT
• Title: Visualizing computation in large-scale cellular automata
• Authors: Hugo Cisneros, Josef Sivic, Tomas Mikolov
• Abstract summary: Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity. We propose methods for coarse-graining cellular automata based on frequency analysis of cell states, clustering and autoencoders.
• Score: 24.62657948019533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution. Such a feat would require scaling up current simulation sizes to allow for enough computational capacity. Understanding complex computations happening in cellular automata and other systems capable of emergence poses many challenges, especially in large-scale systems. We propose methods for coarse-graining cellular automata based on frequency analysis of cell states, clustering and autoencoders. These innovative techniques facilitate the discovery of large-scale structure formation and complexity analysis in those systems. They emphasize interesting behaviors in elementary cellular automata while filtering out background patterns. Moreover, our methods reduce large 2D automata to smaller sizes and enable identifying systems that behave interestingly at multiple scales.

Related papers

• Enhancing Computational Efficiency in Multiscale Systems Using Deep Learning of Coordinates and Flow Maps [0.0]
  This paper showcases how deep learning techniques can be used to develop a precise time-stepping approach for multiscale systems. The resulting framework achieves state-of-the-art predictive accuracy while incurring lesser computational costs.
  arXiv  Detail & Related papers  (2024-04-28T14:05:13Z)
• Causal machine learning for single-cell genomics [94.28105176231739]
  We discuss the application of machine learning techniques to single-cell genomics and their challenges. We first present the model that underlies most of current causal approaches to single-cell biology. We then identify open problems in the application of causal approaches to single-cell data.
  arXiv  Detail & Related papers  (2023-10-23T13:35:24Z)
• Hindsight States: Blending Sim and Real Task Elements for Efficient Reinforcement Learning [61.3506230781327]
  In robotics, one approach to generate training data builds on simulations based on dynamics models derived from first principles. Here, we leverage the imbalance in complexity of the dynamics to learn more sample-efficiently. We validate our method on several challenging simulated tasks and demonstrate that it improves learning both alone and when combined with an existing hindsight algorithm.
  arXiv  Detail & Related papers  (2023-03-03T21:55:04Z)
• Transformers Learn Shortcuts to Automata [52.015990420075944]
  We find that a low-depth Transformer can represent the computations of any finite-state automaton. We show that a Transformer with $O(log T)$ layers can exactly replicate the computation of an automaton on an input sequence of length $T$. We further investigate the brittleness of these solutions and propose potential mitigations.
  arXiv  Detail & Related papers  (2022-10-19T17:45:48Z)
• An Automated Scanning Transmission Electron Microscope Guided by Sparse Data Analytics [0.0]
  We discuss the design of a closed-loop instrument control platform guided by emerging sparse data analytics. We demonstrate how a centralized controller, informed by machine learning combining limited $a$ $priori$ knowledge and task-based discrimination, can drive on-the-fly experimental decision-making.
  arXiv  Detail & Related papers  (2021-09-30T00:25:35Z)
• Classification of Discrete Dynamical Systems Based on Transients [0.0]
  We present a novel classification method applicable to any class of deterministic discrete space and time dynamical systems. We were able to identify a critical region of behavior that corresponds to a phase transition from ordered behavior to chaos. Our work can be used to design systems in which complex structures emerge.
  arXiv  Detail & Related papers  (2021-08-03T15:34:01Z)
• Computational Hierarchy of Elementary Cellular Automata [0.0]
  We study the ability of cellular automata to emulate one another. We show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially. We believe our work can help design parallel computational systems that are Turing-complete and also computationally efficient.
  arXiv  Detail & Related papers  (2021-08-01T10:00:54Z)
• 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)
• Towards an Automatic Analysis of CHO-K1 Suspension Growth in Microfluidic Single-cell Cultivation [63.94623495501023]
  We propose a novel Machine Learning architecture, which allows us to infuse a neural deep network with human-powered abstraction on the level of data. Specifically, we train a generative model simultaneously on natural and synthetic data, so that it learns a shared representation, from which a target variable, such as the cell count, can be reliably estimated.
  arXiv  Detail & Related papers  (2020-10-20T08:36:51Z)
• Classification of Complex Systems Based on Transients [0.0]
  We present a novel classification method applicable to any class of deterministic discrete space and time dynamical systems. The method distinguishes between different behaviors of a system's average time before entering a loop. We use it to classify 2D cellular automata to show that our technique can easily be applied to more complex models of computation.
  arXiv  Detail & Related papers  (2020-08-31T11:47:45Z)
• AutoML-Zero: Evolving Machine Learning Algorithms From Scratch [76.83052807776276]
  We show that it is possible to automatically discover complete machine learning algorithms just using basic mathematical operations as building blocks. We demonstrate this by introducing a novel framework that significantly reduces human bias through a generic search space. We believe these preliminary successes in discovering machine learning algorithms from scratch indicate a promising new direction in the field.
  arXiv  Detail & Related papers  (2020-03-06T19:00:04Z)

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.