• Corpus ID: 240288569

The Set of Orthogonal Tensor Trains

  title={The Set of Orthogonal Tensor Trains},
  author={Pardis Semnani and Elina Robeva},
In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of orthogonally decomposable tensors is defined by appealing quadratic equations. The tensors we consider are an extension of orthogonally decomposable tensors. We show that they are defined by similar quadratic equations, as well as an interesting higher-degree… 

Figures from this paper



Singular vectors of orthogonally decomposable tensors

The spectral theory of orthogonally decomposable tensors is studied and a description of its singular vector tuples as a variety in a product of projective spaces is given.

Symmetric Orthogonal Tensor Decomposition is Trivial

  • T. Kolda
  • Mathematics, Computer Science
  • 2015
If an orthogonal decomposition of an $m-way $n-dimensional symmetric tensor exists, this work proposes a novel method to compute it that reduces to an $n \times n$ symmetric matrix eigenproblem.

Orthogonal Decomposition of Symmetric Tensors

  • Elina Robeva
  • Mathematics, Computer Science
    SIAM J. Matrix Anal. Appl.
  • 2016
This work forms a set of polynomial equations that vanish on the odeco variety and conjecture that these polynomials generate its prime ideal, and proves this conjecture in some cases and gives strong evidence for its overall correctness.

Orthogonal Decomposition of Tensor Trains

The problem of recovering a tensor network decomposition of a given tensor $\mathcal{T}$ in which the tensors at the vertices of the network are orthogonally decomposable is studied and the decomposition problem reduces to a novel matrix decomposition.

Orthogonal and unitary tensor decomposition from an algebraic perspective

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition.

Tensor-Train Decomposition

The new form gives a clear and convenient way to implement all basic operations efficiently, and the efficiency is demonstrated by the computation of the smallest eigenvalue of a 19-dimensional operator.

Most Tensor Problems Are NP-Hard

It is proved that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard and how computing the combinatorial hyperdeterminant is NP-, #P-, and VNP-hard.

Tensor decompositions for learning latent variable models

A detailed analysis of a robust tensor power method is provided, establishing an analogue of Wedin's perturbation theorem for the singular vectors of matrices, and implies a robust and computationally tractable estimation approach for several popular latent variable models.

Tensor Decompositions and Applications

This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or $N$-way array. Decompositions of higher-order

Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks

The curse of dimensionality associated with the Hilbert space of spin systems provides a significant obstruction to the study of condensed matter systems. Tensor networks have proven an important