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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.