CP-TT: using TT-SVD to greedily construct a Canonical Polyadic tensor approximation

2020/11/19 by Ehrlacher, Virginie, Ruiz, Maria Fuente, Lombardi, Damiano
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2011.09725

Abstract

In the present work, a method is proposed in order to compute a Canonical Polyadic (CP) approximation of a given tensor. It is based on a greedy method and an adaptation of the TT-SVD method. The proposed approach can be straightforwardly extended to compute rank-k updates in a stable way. Some numerical experiments are proposed, in which the proposed method is compared to ALS and ASVD methods and performs particularly well for high-order tensors.

Related

• Rank-1 Tensor Approximation Methods and Application to Deflation
• A Fast Implementation for the Canonical Polyadic Decomposition
• Numerical CP Decomposition of Some Difficult Tensors
• Tensor Networks for Latent Variable Analysis: Higher Order Canonical\n Polyadic Decomposition
• Efficient QR-Based CP Decomposition Acceleration via Restructured Dimension Tree and Customized Extrapolation