SoTT: greedy approximation of a tensor as a sum of Tensor Trains - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

SoTT: greedy approximation of a tensor as a sum of Tensor Trains

Résumé

In the present work, a method is proposed in order to compute an approximation of a given tensor as a sum of Tensor Trains (TTs), where the order of the variates and the values of the ranks can vary from one term to the other in an adaptive way. The numerical scheme is based on a greedy algorithm and an adaptation of the TT-SVD method. The proposed approach can also be used in order to compute an approximation of a tensor in a Canonical Polyadic format (CP), as an alternative to standard algorithms like Alternating Linear Squares (ALS) or Alternating Singular Value Decomposition (ASVD) methods. Some numerical experiments are proposed, in which the proposed method is compared to ALS and ASVD methods for the construction of a CP approximation of a given tensor and performs particularly well for high-order tensors. The interest of approximating a tensor as a sum of Tensor Trains is illustrated in several numerical test cases.
Fichier principal
Vignette du fichier
SoTT_HAL.pdf (725.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03018646 , version 1 (24-11-2020)
hal-03018646 , version 2 (02-06-2021)
hal-03018646 , version 3 (17-11-2021)

Identifiants

  • HAL Id : hal-03018646 , version 2

Citer

Virginie Ehrlacher, Maria Fuente-Ruiz, Damiano Lombardi. SoTT: greedy approximation of a tensor as a sum of Tensor Trains. 2021. ⟨hal-03018646v2⟩
467 Consultations
435 Téléchargements

Partager

Gmail Facebook X LinkedIn More