In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

The popular Alternating Least Squares (ALS) algorithm for tensor decomposition is extremely efficient, but often converges to poor local optima, particularly when the weights of the factors are non-uniform. We propose a modification of the ALS approach that is as efficient as standard ALS, but provably recovers the true factors with random initialization under standard incoherence assumptions on the factors of the tensor. We demonstrate the significant practical superiority of our approach over traditional ALS (with both random initialization and SVDbased initialization) for a variety of tasks on synthetic dataincluding tensor factorization on exact, noisy and over-complete tensors, as well as tensor completionand for computing word embeddings from a third-order word tri-occurrence tensor.
Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use