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

by   Yuning Yang, et al.

The epsilon alternating least squares (ϵ-ALS) is developed and analyzed for canonical polyadic decomposition (approximation) of a higher-order tensor where one or more of the factor matrices are assumed to be columnwisely orthonormal. It is shown that the algorithm globally converges to a KKT point for all tensors without any assumption. For the original ALS, by further studying the properties of the polar decomposition, we also establish its global convergence under a reality assumption not stronger than those in the literature. These results completely address a question concerning the global convergence raised in [L. Wang and M. T. Chu, SIAM J. Matrix Anal. Appl., 35 (2014), pp. 1058-1072]. In addition, an initialization procedure is proposed, which possesses a provable lower bound when the number of columnwisely orthonormal factors is one. Armed with this initialization procedure, numerical experiments show that the ϵ-ALS exhibits a promising performance in terms of efficiency and effectiveness.



There are no comments yet.


page 1

page 2

page 3

page 4


Guaranteed Simultaneous Asymmetric Tensor Decomposition via Orthogonalized Alternating Least Squares

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

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

In this paper, we provide local and global convergence guarantees for re...

Analysis of the Stochastic Alternating Least Squares Method for the Decomposition of Random Tensors

Stochastic Alternating Least Squares (SALS) is a method that approximate...

Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing

We consider the problem of reconstructing rank-one matrices from random ...

Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation

The alternating least squares algorithm for CP and Tucker decomposition ...

When geometry meets optimization theory: partially orthogonal tensors

Due to the multi-linearity of tensors, most algorithms for tensor optimi...

Polar decomposition based algorithms on the product of Stiefel manifolds with applications in tensor approximation

In this paper, based on the matrix polar decomposition, we propose a gen...

Code Repositories


epsilon-ALS for orthogonal low rank tensor approximation

view repo
This week in AI

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