Approximate Real Symmetric Tensor Rank

07/25/2022
by   Alperen A. Ergür, et al.
0

We investigate the effect of an ε-room of perturbation tolerance on symmetric tensor decomposition. To be more precise, suppose a real symmetric d-tensor f, a norm ||.|| on the space of symmetric d-tensors, and ε >0 are given. What is the smallest symmetric tensor rank in the ε-neighborhood of f? In other words, what is the symmetric tensor rank of f after a clever ε-perturbation? We prove two theorems and develop three corresponding algorithms that give constructive upper bounds for this question. With expository goals in mind; we present probabilistic and convex geometric ideas behind our results, reproduce some known results, and point out open problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/01/2018

On the tensor rank of 3× 3 permanent and determinant

The tensor rank and border rank of the 3 × 3 determinant tensor is known...
research
05/29/2017

Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors

Many idealized problems in signal processing, machine learning and stati...
research
06/05/2017

Greedy Approaches to Symmetric Orthogonal Tensor Decomposition

Finding the symmetric and orthogonal decomposition (SOD) of a tensor is ...
research
07/20/2021

Counting tensor rank decompositions

The tensor rank decomposition is a useful tool for the geometric interpr...
research
10/29/2021

Landscape analysis of an improved power method for tensor decomposition

In this work, we consider the optimization formulation for symmetric ten...
research
06/03/2020

On tensor rank and commuting matrices

Obtaining superlinear lower bounds on tensor rank is a major open proble...
research
07/20/2023

Perturbation bounds for the largest C-eigenvalue of piezoelectric-type tensors

In this paper, we focus on the perturbation analysis of the largest C-ei...

Please sign up or login with your details

Forgot password? Click here to reset