On the Convergence of Alternating Least Squares Optimisation in Tensor Format Representations

Abstract

The approximation of tensors is important for the efficient numerical treatment of high dimensional problems, but it remains an extremely challenging task. One of the most popular approach to tensor approximation is the alternating least squares method. In our study, the convergence of the alternating least squares algorithm is considered. The analysis is done for arbitrary tensor format representations and based on the multiliearity of the tensor format. In tensor format representation techniques, tensors are approximated by multilinear combinations of objects lower dimensionality. The resulting reduction of dimensionality not only reduces the amount of required storage but also the computational effort.

arXiv admin note: text overlap with arXiv:1503.05431

References in corpus (1)

• Convergence of Alternating Least Squares Optimisation for Rank-One Approximation to High Order Tensors

Cited by in corpus (9)

• Tensor Decomposition for Signal Processing and Machine Learning
• Parallel numerical tensor methods for high-dimensional PDEs
• Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank
• Convergence of Alternating Least Squares Optimisation for Rank-One Approximation to High Order Tensors
• Tensor decomposition for learning Gaussian mixtures from moments
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• Tensor Ring Decomposition: Optimization Landscape and One-loop Convergence of Alternating Least Squares
• Tensor Canonical Correlation Analysis with Convergence and Statistical Guarantees
• CP-TT: using TT-SVD to greedily construct a Canonical Polyadic tensor approximation