Algebraic Methods for Tensor Data

05/25/2020
by   Neriman Tokcan, et al.
0

We develop algebraic methods for computations with tensor data. We give 3 applications: extracting features that are invariant under the orthogonal symmetries in each of the modes, approximation of the tensor spectral norm, and amplification of low rank tensor structure. We introduce colored Brauer diagrams, which are used for algebraic computations and in analyzing their computational complexity. We present numerical experiments whose results show that the performance of the alternating least square algorithm for the low rank approximation of tensors can be improved using tensor amplification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2020

Matrix and tensor rigidity and L_p-approximation

In this note we make two observations. First: the low-rank approximation...
research
12/20/2019

MERACLE: Constructive layer-wise conversion of a Tensor Train into a MERA

In this article two new algorithms are presented that convert a given da...
research
02/17/2015

A New Sampling Technique for Tensors

In this paper we propose new techniques to sample arbitrary third-order ...
research
07/31/2020

Low-rank Tensor Bandits

In recent years, multi-dimensional online decision making has been playi...
research
12/14/2020

Analyzing Large and Sparse Tensor Data using Spectral Low-Rank Approximation

Information is extracted from large and sparse data sets organized as 3-...
research
12/04/2019

Finding entries of maximum absolute value in low-rank tensors

We present an iterative method for the search of extreme entries in low-...
research
09/29/2022

Tensor-Based Sketching Method for the Low-Rank Approximation of Data Streams

Low-rank approximation in data streams is a fundamental and significant ...

Please sign up or login with your details

Forgot password? Click here to reset