Constrained Candecomp/Parafac via the Lasso

The Candecomp/Parafac (CP) model is a well-known tool for summarizing a three-way array by extracting a limited number of components. Unfortunately, in some cases, the model suffers from the socalled degeneracy, that is a solution with diverging and uninterpretable components. To avoid degeneracy, orthogonality constraints are usually applied to one of the component matrices. This solves the problem only from a technical point of view because the existence of orthogonal components underlying the data is not guaranteed. For this purpose, we consider some variants of the CP model where the orthogonality constraints are relaxed either by constraining only a pair, or a subset, of components or by stimulating the CP solution to be possibly orthogonal. We theoretically clarify that only the latter approach, based on the least absolute shrinkage and selection operator and named the CP-Lasso, is helpful in solving the degeneracy problem. The results of the application of CP-Lasso on simulated and real life data show its effectiveness.