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

11/05/2021
by   Amina Sabir, et al.
0

We present an orthogonal matrix outer product decomposition for the fourth-order conjugate partial-symmetric (CPS) tensor and show that the greedy successive rank-one approximation (SROA) algorithm can recover this decomposition exactly. Based on this matrix decomposition, the CP rank of CPS tensor can be bounded by the matrix rank, which can be applied to low rank tensor completion. Additionally, we give the rank-one equivalence property for the CPS tensor based on the SVD of matrix, which can be applied on the rank-one approximation for CPS tensors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2020

Low Rank Triple Decomposition and Tensor Recovery

A simple approach for matrix completion and recovery is via low rank mat...
research
10/08/2020

Orthogonal Decomposition of Tensor Trains

In this paper we study the problem of recovering a tensor network decomp...
research
12/27/2022

CP decomposition and low-rank approximation of antisymmetric tensors

For the antisymmetric tensors the paper examines a low-rank approximatio...
research
06/11/2021

Understanding Deflation Process in Over-parametrized Tensor Decomposition

In this paper we study the training dynamics for gradient flow on over-p...
research
03/03/2020

A Riemannian Newton Optimization Framework for the Symmetric Tensor Rank Approximation Problem

The symmetric tensor rank approximation problem (STA) consists in comput...
research
11/15/2016

Multilinear Low-Rank Tensors on Graphs & Applications

We propose a new framework for the analysis of low-rank tensors which li...
research
02/21/2021

An Optimal Inverse Theorem

We prove that the partition rank and the analytic rank of tensors are eq...

Please sign up or login with your details

Forgot password? Click here to reset