Uniqueness of tensor train decomposition with linear dependencies

Abstract : With the increase in measurement/sensing technologies, the collected data are in intrinsically multidimensional in a large number of applications. This can be interpreted as a growth of the dimensionality/order of the associated tensor. There exists therefore a crucial need to derive equivalent and alternative models of a high-order tensor as a graph of low-order tensors. In this work we consider a " train " graph, i.e., a Q-order tensor will be represented as a Tensor Train (TT) composed of Q − 2 3-order core tensors and two core matrices. In this context, it has been shown that a canonical rank-R CPD / PARAFAC model can always be represented exactly by a TT model whose cores are canonical rank-R CPD/PARAFAC. This model is called TT-CPD. We generalize this equivalence to the PARALIND model in order to take into account potential linear dependencies in factors. We derive and discuss here uniqueness conditions for the case of the TT-PARALIND model.
Complete list of metadatas

Contributor : Remy Boyer <>
Submitted on : Tuesday, May 28, 2019 - 8:01:16 AM
Last modification on : Tuesday, June 11, 2019 - 9:46:53 AM


Files produced by the author(s)


  • HAL Id : hal-02141554, version 1


Yassine Zniyed, Sebastian Miron, Remy Boyer, David Brie. Uniqueness of tensor train decomposition with linear dependencies. XXVIIème Colloque francophone de traitement du signal et des images, GRETSI 2019, Aug 2019, Lille, France. ⟨hal-02141554⟩



Record views


Files downloads