用于分解数据结构的分布式表示的谐振器网络
Resonator networks for factoring distributed representations of data structures
摘要:
通过支持基于规则的符号推理(认知的一个核心属性),用分布式神经表示编码和操纵数据结构的能力可以从质量上增强传统神经网络的能力。在这里,我们展示了如何在向量符号架构(VSA)(Plate,1991; Gayler,1998; Kanerva,1996)的框架内实现这一点,其中数据结构通过将高维向量与操作组合在一起形成分布式表示空间上的代数来编码。特别是,我们提出了一个有效的解决方案,硬组合搜索问题时出现的解码元素的VSA数据结构:因式分解的产品的多个代码向量。我们提出的算法,称为谐振器网络,是一种新型的递归神经网络,交织VSA乘法运算和模式完成。我们展示了两个例子-解析的树状数据结构和解析的视觉场景-如何出现的分解问题,以及如何谐振器网络可以解决it. More广义上说,谐振器网络打开的可能性,应用VSA无数的人工智能问题在现实世界的领域。一篇配套论文(Kent et al.,2020)对谐振器网络的性能进行了严格的分析和评估,表明它优于其他方法。
英文摘要:
The ability to encode and manipulate data structures with distributed neural representations could qualitatively enhance the capabilities of traditional neural networks by supporting rule-based symbolic reasoning, a central property of cognition. Here we show how this may be accomplished within the framework of Vector Symbolic Architectures (VSA) (Plate, 1991; Gayler, 1998; Kanerva, 1996), whereby data structures are encoded by combining high-dimensional vectors with operations that together form an algebra on the space of distributed representations. In particular, we propose an efficient solution to a hard combinatorial search problem that arises when decoding elements of a VSA data structure: the factorization of products of multiple code vectors. Our proposed algorithm, called a resonator network, is a new type of recurrent neural network that interleaves VSA multiplication operations and pattern completion. We show in two examples -- parsing of a tree-like data structure and parsing of a visual scene -- how the factorization problem arises and how the resonator network can solve it. More broadly, resonator networks open the possibility to apply VSAs to myriad artificial intelligence problems in real-world domains. A companion paper (Kent et al., 2020) presents a rigorous analysis and evaluation of the performance of resonator networks, showing it out-performs alternative approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。