arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.3215stat.OTmath.STstat.TH
收藏

CANDECOMP/PARAFAC张量分解的Cramer-Rao诱导界

Cramer-Rao-Induced Bounds for CANDECOMP/PARAFAC tensor decomposition

Petr Tichavsky, Anh Huy Phan, Zbynek Koldovsky

摘要:

本文给出了噪声观测张量的正则多进(CP)或CANDECOMP/PARAFAC(CP)分解中因子矩阵的无偏估计方差的Cramer-Rao下界(CRLB),张量加上随机高斯独立同分布张量)。一个新的表达式推导出的约束上的均方角误差的因素沿选定的尺寸的张量的任意尺寸。该表达式需要更少的运算来计算边界,O(NR^6),比现有最好的最先进的算法,O(N^3R^6)操作,其中N和R是张量阶和张量秩。有见地的表达式推导出张量的秩1和秩2的任意尺寸和张量的任意尺寸和秩,其中两个因子矩阵有正交列。这些结果可以用来衡量不同近似CP分解算法的性能,预测其精度,并检查张量的给定分解的稳定性(条件是否CRLB是有限的或不)。推导了求解含缺失元素张量CP分解的阻尼Gauss-Newton方法所需的Hessian矩阵的新表达式。除了计算这些张量的CRLB外,该表达式还可用于设计分解的阻尼高斯-牛顿算法。

英文摘要:

This paper presents a Cramer-Rao lower bound (CRLB) on the variance of unbiased estimates of factor matrices in Canonical Polyadic (CP) or CANDECOMP/PARAFAC (CP) decompositions of a tensor from noisy observations, (i.e., the tensor plus a random Gaussian i.i.d. tensor). A novel expression is derived for a bound on the mean square angular error of factors along a selected dimension of a tensor of an arbitrary dimension. The expression needs less operations for computing the bound, O(NR^6), than the best existing state-of-the art algorithm, O(N^3R^6) operations, where N and R are the tensor order and the tensor rank. Insightful expressions are derived for tensors of rank 1 and rank 2 of arbitrary dimension and for tensors of arbitrary dimension and rank, where two factor matrices have orthogonal columns. The results can be used as a gauge of performance of different approximate CP decomposition algorithms, prediction of their accuracy, and for checking stability of a given decomposition of a tensor (condition whether the CRLB is finite or not). A novel expression is derived for a Hessian matrix needed in popular damped Gauss-Newton method for solving the CP decomposition of tensors with missing elements. Beside computing the CRLB for these tensors the expression may serve for design of damped Gauss-Newton algorithm for the decomposition.

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

↑