CP Decomposition for Tensors via Alternating Least Squares with QR Decomposition

12/20/2021
by   Rachel Minster, et al.
0

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition (SVD), which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error and more reliably recover low-rank signals from data with known ground truth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2020

Triple Decomposition and Tensor Recovery of Third Order Tensors

In this paper, we introduce a new tensor decomposition for third order t...
research
10/20/2022

Practical Alternating Least Squares for Tensor Ring Decomposition

Tensor ring (TR) decomposition has been widely applied as an effective a...
research
04/14/2022

Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition

CP decomposition (CPD) is prevalent in chemometrics, signal processing, ...
research
06/30/2020

Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning

We consider the problem of factorizing a structured 3-way tensor into it...
research
03/04/2023

Tensorized LSSVMs for Multitask Regression

Multitask learning (MTL) can utilize the relatedness between multiple ta...
research
11/19/2020

CP-TT: using TT-SVD to greedily construct a Canonical Polyadic tensor approximation

In the present work, a method is proposed in order to compute a Canonica...
research
03/04/2016

Identifiability of an X-rank decomposition of polynomial maps

In this paper, we study a polynomial decomposition model that arises in ...

Please sign up or login with your details

Forgot password? Click here to reset