Low Rank Tensor Decompositions and Approximations

08/16/2022
by   Jiawang Nie, et al.
0

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank decompositions and low rank tensor approximations. We prove that this gives a quasi-optimal low rank tensor approximation if the given tensor is sufficiently close to a low rank one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2021

Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions

Low rank tensor approximation is a fundamental tool in modern machine le...
research
08/31/2023

Dynamical low-rank tensor approximations to high-dimensional parabolic problems: existence and convergence of spatial discretizations

We consider dynamical low-rank approximations to parabolic problems on h...
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
09/14/2020

Continuous dictionaries meet low-rank tensor approximations

In this short paper we bridge two seemingly unrelated sparse approximati...
research
06/22/2022

tntorch: Tensor Network Learning with PyTorch

We present tntorch, a tensor learning framework that supports multiple d...
research
12/15/2021

Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor

The canonical polyadic decomposition (CPD) of a low rank tensor plays a ...
research
01/19/2022

Tensor Ranks for the Pedestrian for Dimension Reduction and Disentangling Interactions

A tensor is a multi-way array that can represent, in addition to a data ...

Please sign up or login with your details

Forgot password? Click here to reset