Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updates

by   Rong Ge, et al.

In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank-1 update which is the alternating version of the tensor power iteration adapted for asymmetric tensors. Local convergence guarantees are established for third order tensors of rank k in d dimensions, when k=o ( d^1.5) and the tensor components are incoherent. Thus, we can recover overcomplete tensor decomposition. We also strengthen the results to global convergence guarantees under stricter rank condition k <β d (for arbitrary constant β > 1) through a simple initialization procedure where the algorithm is initialized by top singular vectors of random tensor slices. Furthermore, the approximate local convergence guarantees for p-th order tensors are also provided under rank condition k=o ( d^p/2). The guarantees also include tight perturbation analysis given noisy tensor.



page 1

page 2

page 3

page 4


On the tensor rank of 3× 3 permanent and determinant

The tensor rank and border rank of the 3 × 3 determinant tensor is known...

Guaranteed Simultaneous Asymmetric Tensor Decomposition via Orthogonalized Alternating Least Squares

We consider the asymmetric orthogonal tensor decomposition problem, and ...

The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence

The epsilon alternating least squares (ϵ-ALS) is developed and analyzed ...

Tensor Principal Component Analysis in High Dimensional CP Models

The CP decomposition for high dimensional non-orthogonal spike tensors i...

Multi-resolution Low-rank Tensor Formats

We describe a simple, black-box compression format for tensors with a mu...

Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition

CP decomposition (CPD) is prevalent in chemometrics, signal processing, ...

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

We study the optimization problem for decomposing d dimensional fourth-o...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.