Cellular Automata Can Reduce Memory Requirements of Collective-State Computing

TL;DR

This paper demonstrates that elementary cellular automaton rule 90 can reduce memory needs in collective-state computing by expanding representations dynamically, maintaining performance while lowering storage requirements.

Contribution

It introduces a novel method using CA90 for on-the-fly expansion of representations, reducing the need for storing large sets of random patterns in collective-state models.

Findings

CA90 enables space-time tradeoff in collective-state computing.

CA90 preserves similarity despite initialization noise.

Performance comparable to traditional models with reduced memory usage.

Abstract

Various non-classical approaches of distributed information processing, such as neural networks, computation with Ising models, reservoir computing, vector symbolic architectures, and others, employ the principle of collective-state computing. In this type of computing, the variables relevant in a computation are superimposed into a single high-dimensional state vector, the collective-state. The variable encoding uses a fixed set of random patterns, which has to be stored and kept available during the computation. Here we show that an elementary cellular automaton with rule 90 (CA90) enables space-time tradeoff for collective-state computing models that use random dense binary representations, i.e., memory requirements can be traded off with computation running CA90. We investigate the randomization behavior of CA90, in particular, the relation between the length of the randomization period and the size of the grid, and how CA90 preserves similarity in the presence of the initialization noise. Based on these analyses we discuss how to optimize a collective-state computing model, in which CA90 expands representations on the fly from short seed patterns - rather than storing the full set of random patterns. The CA90 expansion is applied and tested in concrete scenarios using reservoir computing and vector symbolic architectures. Our experimental results show that collective-state computing with CA90 expansion performs similarly compared to traditional collective-state models, in which random patterns are generated initially by a pseudo-random number generator and then stored in a large memory.