arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.07411math.NAcs.NAmath.AG
收藏

张量秩分解的正规形算法

A Normal Form Algorithm for Tensor Rank Decomposition

Simon Telen, Nick Vannieuwenhoven

AI总结:

本文提出一种基于多项式方程组和多分级正则性的张量秩分解数值算法,证明了多种张量格式的有效复杂度界,并猜想一般公式,实验表明其在精度、时间和内存上均优于现有方法一个数量级。

摘要:

我们提出一种新的数值算法,用于计算受秩和一般性约束的高阶张量的张量秩分解或规范多元分解。将该计算问题重新表述为多项式方程组,使我们能够利用计算代数几何中最近的数值线性代数工具。我们用该多项式系统的一个代数性质——多分级正则性——来刻画算法的复杂度。我们证明了许多张量格式和秩的有效界,这些界对于超定多项式系统求解具有独立的意义。此外,我们猜想了一个多分级正则性的一般公式,在所考虑的情形下为张量秩分解问题给出了(参数化的)多项式时间复杂度。我们的数值实验表明,在精度、计算时间和内存消耗方面,我们的算法可以比最先进的数值算法高出一个数量级。

英文摘要:

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system of polynomial equations allows us to leverage recent numerical linear algebra tools from computational algebraic geometry. We characterize the complexity of our algorithm in terms of an algebraic property of this polynomial system -- the multigraded regularity. We prove effective bounds for many tensor formats and ranks, which are of independent interest for overconstrained polynomial system solving. Moreover, we conjecture a general formula for the multigraded regularity, yielding a (parameterized) polynomial time complexity for the tensor rank decomposition problem in the considered setting. Our numerical experiments show that our algorithm can outperform state-of-the-art numerical algorithms by an order of magnitude in terms of accuracy, computation time, and memory consumption.

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

↑