一种基于平方和优化的过完备张量分解新算法
A new Algorithm for Overcomplete Tensor Decomposition based on Sums-of-Squares Optimisation
AI总结:
本文提出了一种基于平方和优化的新算法,通过低次约简多项式将高次齐次多项式转化为接近秩1形式的二次形式,从而实现张量分解。
摘要:
在本论文中,提出了一种基于平方和规划的新算法类别。这些算法允许将一个次数为d的齐次多项式T = sum_{i=1}^m ⟨a_i, X⟩^d 通过一个低次约简多项式W∈sum ℝ[X]^2转化为接近秩1形式的二次形式。W可以被视为一个'权重函数',在仅一个组件a_i上取得高值。然后可以通过对二次形式sum_{i=1}^m W(a_i) ⟨a_i, X⟩^2进行特征值分解来提取该组件。
英文摘要:
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a rank-$1$ form via a low-degree reduction polynomial $W\in\sum \mathbb{R}[X]^2$. $W$ can be thought of as a `weight function' attaining high values on merely one of the components $a_i$. The component can then be extracted by running an eigenvalue decomposition on the quadratic form $\sum_{i=1}^m W(a_i) \langle a_i, X \rangle^2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。