Coherence Constrained Alternating Least Squares

In this paper we present a modification of alternating least squares (ALS) for tensor canonical polyadic approximation that takes into account mutual coherence constraints. The proposed algorithm can be used to ensure well-posedness of the tensor approximation problem during ALS iterates and so is an alternative to existing approaches. We conduct tests with the proposed approach by using it as initialization of unconstrained alternating least squares in difficult cases, when the underlying tensor model factors have nearly collinear columns and the unconstrained approach is prone to a degenerate behavior, failing to converge or converging slowly to an acceptable solution. The results of the tested cases indicate that by using such an initialization the unconstrained approach seems to avoid such a behavior.

[1]  B. Kowalski,et al.  Tensorial resolution: A direct trilinear decomposition , 1990 .

[2]  P. Comon,et al.  Tensor decompositions, alternating least squares and other tales , 2009 .

[3]  Souleymen Sahnoun,et al.  Joint Source Estimation and Localization , 2015, IEEE Transactions on Signal Processing.

[4]  Nikos D. Sidiropoulos,et al.  Parallel factor analysis in sensor array processing , 2000, IEEE Trans. Signal Process..

[5]  Rasmus Bro,et al.  MULTI-WAY ANALYSIS IN THE FOOD INDUSTRY Models, Algorithms & Applications , 1998 .

[6]  R. Dykstra An Algorithm for Restricted Least Squares Regression , 1983 .

[7]  Morten Mørup,et al.  Applications of tensor (multiway array) factorizations and decompositions in data mining , 2011, WIREs Data Mining Knowl. Discov..

[8]  Vin de Silva,et al.  Tensor rank and the ill-posedness of the best low-rank approximation problem , 2006, math/0607647.

[9]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[10]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[11]  Pierre Comon,et al.  Tensors : A brief introduction , 2014, IEEE Signal Processing Magazine.

[12]  A. Stegeman Degeneracy in Candecomp/Parafac explained for p × p × 2 arrays of rank p + 1 or higher , 2006 .

[13]  Nick Vannieuwenhoven,et al.  The Condition Number of Join Decompositions , 2016, SIAM J. Matrix Anal. Appl..

[14]  Jeremy E. Cohen About Notations in Multiway Array Processing , 2015, ArXiv.

[15]  F. L. Hitchcock The Expression of a Tensor or a Polyadic as a Sum of Products , 1927 .

[16]  Pierre Comon,et al.  Blind Multilinear Identification , 2012, IEEE Transactions on Information Theory.

[17]  F Wendling,et al.  EEG extended source localization: Tensor-based vs. conventional methods , 2014, NeuroImage.

[18]  Mark D. Plumbley,et al.  Learning Incoherent Dictionaries for Sparse Approximation Using Iterative Projections and Rotations , 2013, IEEE Transactions on Signal Processing.

[19]  N. Higham Computing the nearest correlation matrix—a problem from finance , 2002 .