arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.03585cs.NEcs.LG
收藏

元胞自动机可以减少集体状态计算的内存需求

Cellular Automata Can Reduce Memory Requirements of Collective-State Computing

University of California, Berkeley(加州大学伯克利分校);Research Institutes of Sweden(瑞典研究院);Intel Labs(英特尔研究院)

Denis Kleyko, E. Paxon Frady, Friedrich T. Sommer

摘要:

分布式信息处理的各种非经典方法,例如神经网络、使用伊辛模型的计算、储备池计算、矢量符号架构等,采用集体状态计算的原理。在这种类型的计算中,计算中相关的变量被叠加到单个高维状态向量中,即集体状态。变量编码使用一组固定的随机模式,这些模式必须在计算期间存储并保持可用。在这里,我们证明了具有规则90(CA 90)的基本元胞自动机能够为使用随机密集二进制表示的集体状态计算模型实现时空权衡,即,存储器需求可以与运行CA 90的计算折衷。我们研究了CA 90的随机化行为,特别是,随机化周期的长度和网格的大小之间的关系,以及CA 90如何在存在初始化噪声的情况下保持相似性。基于这些分析,我们讨论了如何优化集体状态计算模型,其中CA 90从短种子模式扩展表示-而不是存储完整的随机模式集。CA 90扩展在具体场景中使用储备池计算和矢量符号架构进行应用和测试。我们的实验结果表明,与传统的集体状态模型,其中随机模式最初产生的伪随机数发生器,然后存储在一个大的存储器相比,集体状态计算与CA 90扩展执行类似。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑