arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.08349math.NAcs.NA
收藏

误差保持修正用于CPD和有界范数CPD

Error Preserving Correction for CPD and Bounded-Norm CPD

Brain Science Institute, RIKEN(RIKEN脑科学研究所);Systems Research Institute PAS(波兰科学院系统研究所);Skolkovo Institute of Science and Technology (Skoltech)(斯科尔科沃科学技术研究所);Institute of Information Theory and Automation(信息与自动化研究所)

Anh-Huy Phan, Petr Tichavský, Andrzej Cichocki

AI总结:

本文提出误差保持修正方法,解决CPD分解中因秩-1项范数过大导致算法陷入局部极小的问题,同时提出带有范数约束的新型CPD方法。

摘要:

在CANDECOMP/PARAFAC张量分解中,当秩超过张量维度或加载组件高度共线时,秩-1项的范数会显著增大并相互抵消,导致算法在大量迭代中无法改善分解。本文提出误差保持修正方法,旨在寻找一个新张量,其秩-1项范数在优化问题中最小化,同时保持近似误差。开发了交替修正算法和全一算法,并提出带有秩-1张量范数约束的新型CPD方法,该方法可用于传统算法无法分析的张量,如矩阵乘法对应的张量。

英文摘要:

In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in some difficult scenarios, e.g., when the rank exceeds the tensor dimension, or when the loading components are highly collinear in several or all modes, or when CPD does not have an optimal solution. In such the cases, norms of some rank-1 terms become significantly large and cancel each other. This makes algorithms getting stuck in local minima while running a huge number of iterations does not improve the decomposition. In this paper, we propose an error preservation correction method to deal with such problem. Our aim is to seek a new tensor whose norms of rank-1 tensor components are minimised in an optimization problem, while it preserves the approximation error. An alternating correction algorithm and an all-atone algorithm have been developed for the problem. In addition, we propose a novel CPD with a bound constraint on a norm of the rank-one tensors. The method can be useful for decomposing tensors that cannot be analyzed by traditional algorithms, such as tensors corresponding to the matrix multiplication.

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

↑