Guarantees for Alternating Least Squares in Overparameterized Tensor Decompositions

TL;DR

Tensor decomposition is a canonical non-convex optimization problem that is computationally challenging, and yet important due to applications in factor analysis and parameter estimation of latent var…

Opening excerpt from the authors’ abstract. source