arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.04530cs.CCcs.ETcs.NAmath.NA
收藏

线性方程组内存求解的时间复杂度

Time complexity of in-memory solution of linear systems

Zhong Sun, Giacomo Pedretti, Piergiulio Mannocci, Elia Ambrosi, Alessandro Bricalli, Daniele Ielmini

摘要:

具有交叉点电阻存储器阵列的存内计算已经被证明可以加速以数据为中心的计算,例如深度神经网络的训练和推理,这要归功于电路中的物理规则赋予的高度并行性。通过将交叉点阵列与负反馈放大器连接,可以在一个步骤中解决线性代数问题,例如线性系统和矩阵特征向量。基于反馈电路理论,我们研究了线性系统在存储器阵列中的解的动力学,证明了解的时间复杂度与问题的规模N没有任何直接关系,而是由系数矩阵的相关矩阵的最小特征值决定.我们证明了,当线性系统由协方差矩阵建模时,时间复杂度为O(logN)或O(1)。在稀疏正定线性系统的情况下,时间复杂度仅由系数矩阵的最小特征值决定。这些结果证明了电路在广泛应用中求解线性系统的高速性,从而支持存内计算作为未来大数据和机器学习加速器的强有力候选。

英文摘要:

In-memory computing with crosspoint resistive memory arrays has been shown to accelerate data-centric computations such as the training and inference of deep neural networks, thanks to the high parallelism endowed by physical rules in the electrical circuits. By connecting crosspoint arrays with negative feedback amplifiers, it is possible to solve linear algebraic problems such as linear systems and matrix eigenvectors in just one step. Based on the theory of feedback circuits, we study the dynamics of the solution of linear systems within a memory array, showing that the time complexity of the solution is free of any direct dependence on the problem size N, rather it is governed by the minimal eigenvalue of an associated matrix of the coefficient matrix. We show that, when the linear system is modeled by a covariance matrix, the time complexity is O(logN) or O(1). In the case of sparse positive-definite linear systems, the time complexity is solely determined by the minimal eigenvalue of the coefficient matrix. These results demonstrate the high speed of the circuit for solving linear systems in a wide range of applications, thus supporting in-memory computing as a strong candidate for future big data and machine learning accelerators.

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

↑