Orthogonal Decomposition of Tensor Trains

10/08/2020
by   Karim Halaseh, et al.
0

In this paper we study the problem of recovering a tensor network decomposition of a given tensor 𝒯 in which the tensors at the vertices of the network are orthogonally decomposable. Specifically, we consider tensor networks in the form of tensor trains (aka matrix product states). When the tensor train has length 2, and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we show how to recover the decomposition by considering random linear combinations of slices. Furthermore, if the tensors at the vertices are symmetric but not orthogonally decomposable, we show that a whitening procedure can transform the problem into an orthogonal one, thereby yielding a solution for the decomposition of the tensor. When the tensor network has length 3 or more and the tensors at the vertices are symmetric and orthogonally decomposable, we provide an algorithm for recovering them subject to some rank conditions. Finally, in the case of tensor trains of length two in which the tensors at the vertices are orthogonally decomposable but not necessarily symmetric, we show that the decomposition problem reduces to the problem of a novel matrix decomposition, that of an orthogonal matrix multiplied by diagonal matrices on either side. We provide two solutions for the full-rank tensor case using Sinkhorn's theorem and Procrustes' algorithm, respectively, and show that the Procrustes-based solution can be generalized to any rank case. We conclude with a multitude of open problems in linear and multilinear algebra that arose in our study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2021

The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor

We present an orthogonal matrix outer product decomposition for the four...
research
11/05/2021

The decompositions and positive semidefiniteness of fourth-order conjugate partial-symmetric tensors with applications

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitia...
research
06/14/2019

Optimal orthogonal approximations to symmetric tensors cannot always be chosen symmetric

We study the problem of finding orthogonal low-rank approximations of sy...
research
10/28/2018

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons

We analyze linear independence of rank one tensors produced by tensor po...
research
03/03/2022

Real eigenstructure of regular simplex tensors

We are concerned with the eigenstructure of supersymmetric tensors. Like...
research
05/23/2019

User-Device Authentication in Mobile Banking using APHEN for Paratuck2 Tensor Decomposition

The new financial European regulations such as PSD2 are changing the ret...
research
06/05/2017

Greedy Approaches to Symmetric Orthogonal Tensor Decomposition

Finding the symmetric and orthogonal decomposition (SOD) of a tensor is ...

Please sign up or login with your details

Forgot password? Click here to reset