arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.00920cs.NE
收藏

基于组合分布表示的矩阵分解

Integer Factorization with Compositional Distributed Representations

Denis Kleyko, Connor Bybee, Christopher J. Kymn, Bruno A. Olshausen, Amir Khosrowshahi, Dmitri E. Nikonov, Friedrich T. Sommer, E. Paxon Frady

摘要:

在本文中,我们提出了一种整数因式分解的方法,使用矢量符号架构形成的分布式表示。该方法制定整数因式分解的方式,使它可以解决使用神经网络,并可能实现并行神经形态硬件。我们介绍了一种在分布式向量空间中编码数字的方法,并解释了谐振器网络如何解决整数分解问题。我们评估的方法,半素数的因式分解的因式分解精度与规模的问题。我们还演示了如何提出的方法推广超出了半素数的因式分解,原则上,它可以用于因式分解的任何复合数。这项工作演示了如何一个著名的组合搜索问题可以制定和解决的框架内的矢量符号架构,它打开了大门,解决类似的困难问题,在其他领域。

英文摘要:

In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural networks and potentially implemented on parallel neuromorphic hardware. We introduce a method for encoding numbers in distributed vector spaces and explain how the resonator network can solve the integer factorization problem. We evaluate the approach on factorization of semiprimes by measuring the factorization accuracy versus the scale of the problem. We also demonstrate how the proposed approach generalizes beyond the factorization of semiprimes; in principle, it can be used for factorization of any composite number. This work demonstrates how a well-known combinatorial search problem may be formulated and solved within the framework of Vector Symbolic Architectures, and it opens the door to solving similarly difficult problems in other domains.

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

↑