Home » Tensor decompositions & algorithms

Tensor decompositions & algorithms

The decompositions of higher-order tensors can be viewed as generalizations of matrix decompositions to orders higher than two. Figure 1 depicts the parallel factor (PARAFAC) decomposition, also known as the canonical polyadic decomposition (CPD), perhaps the most popular tensor decomposition. It has been extensively studied and considered in numerous application domains, ranging from psychometrics and chemometrics to signal processing and machine learning.

Figure 1: The PARAFAC decomposition of a third-order tensor, represented as a sum of rank-one components.

The attractive feature of the PARAFAC decomposition is its intrinsic uniqueness. In contrast to matrix (bilinear) decompositions, where there is the well-known problem of rotational freedom, the PARARAC decomposition of higher-order tensors is essentially unique, up to scaling and permutation indeterminacies. Tensor decompositions fall within an interdisciplinary research field. Although important progress has been made, research has several intriguing and open-ranging fields ranging from fundamental studies such as uniqueness, degeneracies, and rank to more practical aspects, where tensor decompositions are used to model complex physical phenomena.

Recent attention has also been devoted to distributed algorithms for decomposing large-scale (big data) tensors. In this context, we highlight the role of tensor networks, a network model formed by multiple tensors following specific contracted rules.

[1] P. Comon, X. Luciani, A. L. F. de Almeida, “Tensor decompositions, alternating least squares and other tales,” Journal of Chemometrics, vol. 23, no.7-8, pp. 393-405,  Aug. 2009.

[2] G. Favier, A. L. F. de Almeida, “Overview of constrained PARAFAC models,” EURASIP Journal on Advances in Signal Processing, v. 2014, p. 142, 2014.

[3] Y. Zniyed, R. Boyer, A.L.F. de Almeida, G. Favier, “A TT-based hierarchical framework for decomposing high-order tensors,” SIAM Journal on Scientific Computing, vol. 42, no. 2, pp. A822–A848, 2020.

[4] M. Giraud, V. Itier, R. Boyer, Y. Znyed, A. L. F. de Almeida, “Tucker Decomposition Based on a Tensor Train of Coupled and Constrained CP Cores,” IEEE Signal Processing Letters, vol. 30, pp. 758-762, 2023.

[5]  A. L. F. de Almeida, A. Y. Kibangou, “Distributed large-scale tensor decomposition, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2014), Florence, 2014. v. 1. p. 1-5.