arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.14775math.OC
收藏

一维三阶张量谱范数与核范数的复杂性与计算

Complexity and computation for the spectral norm and nuclear norm of order three tensors with one fixed dimension

Haodong Hu, Bo Jiang, Zhening Li

摘要:

近十年来,从双向数据(矩阵)到多向数据(张量),建模和计算方面的研究激增。然而,对于大多数张量最优化问题,当张量的阶数从2(矩阵)增加到3时,会出现剧烈的相变:大多数张量问题是NP困难的,而矩阵问题则很容易。这引发了一个问题,即过渡到底发生在哪里。本文主要研究这类问题的谱范数和核范数。虽然计算一般$\ell\times m\times n$张量的谱范数是NP-困难的,我们表明,它可以在多项式时间内计算,如果$\ell$是固定的。核规范也是如此。虽然这些多项式时间的方法在实践中是不可实现的,我们提出了充分的多项式时间近似方案(FPTAS)的谱范数的基础上的球面网格和核范数的进一步帮助下的对偶理论和半定优化。模拟数据的数值实验表明,我们的FPTAS可以计算这些张量范数小$\ell \le 6$,但大$m, n\ge50$。据我们所知,这是第一个可以计算一般非对称张量核范数的方法。我们的多项式时间算法和FPTAS都可以扩展到高阶张量。

英文摘要:

The recent decade has witnessed a surge of research in modelling and computing from two-way data (matrices) to multiway data (tensors). However, there is a drastic phase transition for most tensor optimization problems when the order of a tensor increases from two (a matrix) to three: Most tensor problems are NP-hard while that for matrices are easy. It triggers a question on where exactly the transition occurs. The paper aims to study this kind of question for the spectral norm and the nuclear norm. Although computing the spectral norm for a general $\ell\times m\times n$ tensor is NP-hard, we show that it can be computed in polynomial time if $\ell$ is fixed. This is the same for the nuclear norm. While these polynomial-time methods are not implementable in practice, we propose fully polynomial-time approximation schemes (FPTAS) for the spectral norm based on spherical grids and for the nuclear norm with further help of duality theory and semidefinite optimization. Numerical experiments on simulated data show that our FPTAS can compute these tensor norms for small $\ell \le 6$ but large $m, n\ge50$. To the best of our knowledge, this is the first method that can compute the nuclear norm of general asymmetric tensors. Both our polynomial-time algorithms and FPTAS can be extended to higher-order tensors as well.

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

↑