On the Non-Existence of Optimal Solutions and the Occurrence of “Degeneracy” in the CANDECOMP/PARAFAC Model

The CANDECOMP/PARAFAC (CP) model decomposes a three-way array into a prespecified number of R factors and a residual array by minimizing the sum of squares of the latter. It is well known that an optimal solution for CP need not exist. We show that if an optimal CP solution does not exist, then any sequence of CP factors monotonically decreasing the CP criterion value to its infimum will exhibit the features of a so-called “degeneracy”. That is, the parameter matrices become nearly rank deficient and the Euclidean norm of some factors tends to infinity. We also show that the CP criterion function does attain its infimum if one of the parameter matrices is constrained to be column-wise orthonormal

About the maximal rank of 3-tensors over the real and the complex number field

High dimensional array data, tensor data, is becoming important in recent days. Then maximal rank of tensors is important in theory and applications. In this paper we consider the maximal rank of 3 tensors. It can be attacked from various viewpoints, however, we trace the method of Atkinson-Stephens(1979) and Atkinson-Lloyd(1980). They treated the problem in the complex field, and we will present various bounds over the real field by proving several lemmas and propositions, which is real counterparts of their results.Comment: 13 pages, no figure v2: correction and improvemen

Degeneracy in Candecomp/Parafac and Indscal Explained For Several Three-Sliced Arrays With A Two-Valued Typical Rank

The Candecomp/Parafac (CP) method decomposes a three-way array into a prespecified number R of rank-1 arrays, by minimizing the sum of squares of the residual array. The practical use of CP is sometimes complicated by the occurrence of so-called degenerate sequences of solutions, in which several rank-1 arrays become highly correlated in all three modes and some elements of the rank-1 arrays become arbitrarily large. We consider the real-valued CP decomposition of all known three-sliced arrays, i.e., of size p×q×3, with a two-valued typical rank. These are the 5×3×3 and 8×4×3 arrays, and the 3×3×4 and 3×3×5 arrays with symmetric 3×3 slices. In the latter two cases, CP is equivalent to the Indscal model. For a typical rank of {m,m+1}, we consider the CP decomposition with R=m of an array of rank m+1. We show that (in most cases) the CP objective function does not have a minimum but an infimum. Moreover, any sequence of feasible CP solutions in which the objective value approaches the infimum will become degenerate. We use the tools developed in Stegeman (2006), who considers p×p×2 arrays, and present a framework of analysis which is of use to the future study of CP degeneracy related to a two-valued typical rank. Moreover, our examples show that CP uniqueness is not necessary for degenerate solutions to occur

Entanglement or separability: The choice of how to factorize the algebra of a density matrix

We discuss the concept of how entanglement changes with respect to different factorizations of the total algebra which describes the quantum states. Depending on the considered factorization a quantum state appears either entangled or separable. For pure states we always can switch unitarily between separability and entanglement, however, for mixed states a minimal amount of mixedness is needed. We discuss our general statements in detail for the familiar case of qubits, the GHZ states, Werner states and Gisin states, emphasizing their geometric features. As theorists we use and play with this free choice of factorization, which is naturally fixed for an experimentalist. For theorists it offers an extension of the interpretations and is adequate to generalizations, as we point out in the examples of quantum teleportation and entanglement swapping.Comment: 29 pages, 9 figures. Introduction, Conclusion and References have been extended in v

Effective hybrid recommendation combining users-searches correlations using tensors

Most recommendation methods employ item-item similarity measures or use ratings data to generate recommendations. These methods use traditional two dimensional models to find inter relationships between alike users and products. This paper proposes a novel recommendation method using the multi-dimensional model, tensor, to group similar users based on common search behaviour, and then finding associations within such groups for making effective inter group recommendations. Web log data is multi-dimensional data. Unlike vector based methods, tensors have the ability to highly correlate and find latent relationships between such similar instances, consisting of users and searches. Non redundant rules from such associations of user-searches are then used for making recommendations to the users

Age interval and gender prediction using PARAFAC2 and SVMs based on visual and aural features

Parallel factor analysis 2 (PARAFAC2) is employed to reduce the dimensions of visual and aural features and provide ranking vectors. Subsequently, score level fusion is performed by applying a support vector machine (SVM) classifier to the ranking vectors derived by PARAFAC2 to make gender and age interval predictions. The aforementioned procedure is applied to the Trinity College Dublin Speaker Ageing database, which is supplemented with face images of the speakers and two single-modality benchmark datasets. Experimental results demonstrate the advantage of using combined aural and visual features for both prediction tasks

Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices

Candecomp, Parafac, Indscal, three-way arrays, uniqueness,