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

11/19/2020
by   Virginie Ehrlacher, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2021

T-Singular Values and T-Sketching for Third Order Tensors

Based upon the T-SVD (tensor SVD) of third order tensors, introduced by ...
research
08/22/2022

Efficient construction of canonical polyadic approximations of tensor networks

We consider the problem of constructing a canonical polyadic (CP) decomp...
research
05/08/2023

Adaptive Cross Tubal Tensor Approximation

In this paper, we propose a new adaptive cross algorithm for computing a...
research
12/20/2021

CP Decomposition for Tensors via Alternating Least Squares with QR Decomposition

The CP tensor decomposition is used in applications such as machine lear...
research
03/04/2023

Tensorized LSSVMs for Multitask Regression

Multitask learning (MTL) can utilize the relatedness between multiple ta...
research
12/07/2021

Accelerating jackknife resampling for the Canonical Polyadic Decomposition

The Canonical Polyadic (CP) tensor decomposition is frequently used as a...
research
02/09/2018

Curve Registered Coupled Low Rank Factorization

We propose an extension of the canonical polyadic (CP) tensor model wher...

Please sign up or login with your details

Forgot password? Click here to reset