When Does Non-Orthogonal Tensor Decomposition Have No Spurious Local Minima?

11/22/2019
by   Maziar Sanjabi, et al.
0

We study the optimization problem for decomposing d dimensional fourth-order Tensors with k non-orthogonal components. We derive deterministic conditions under which such a problem does not have spurious local minima. In particular, we show that if κ = λ_max/λ_min < 5/4, and incoherence coefficient is of the order O(1/√(d)), then all the local minima are globally optimal. Using standard techniques, these conditions could be easily transformed into conditions that would hold with high probability in high dimensions when the components are generated randomly. Finally, we prove that the tensor power method with deflation and restarts could efficiently extract all the components within a tolerance level O(κ√(kτ^3)) that seems to be the noise floor of non-orthogonal tensor decomposition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2023

Decomposition of linear tensor transformations

One of the main issues in computing a tensor decomposition is how to cho...
research
09/25/2017

Error Preserving Correction for CPD and Bounded-Norm CPD

In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in so...
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
02/11/2023

Optimizing Orthogonalized Tensor Deflation via Random Tensor Theory

This paper tackles the problem of recovering a low-rank signal tensor wi...
research
01/04/2007

Statistical tools to assess the reliability of self-organizing maps

Results of neural network learning are always subject to some variabilit...
research
06/13/2023

Symmetry Critical Points for Symmetric Tensor Decomposition Problems

We consider the non-convex optimization problem associated with the deco...
research
07/07/2021

Decomposition of flow data via gradient-based transport optimization

We study an optimization problem related to the approximation of given d...

Please sign up or login with your details

Forgot password? Click here to reset