Skip to Main content Skip to Navigation
Journal articles

Computing the polyadic decomposition of nonnegative third order tensors

Abstract : Computing the minimal polyadic decomposition (also often referred to as canonical decomposition, or sometimes Parafac) amounts to finding the global minimum of a coercive polynomial in many variables. In the case of arrays with nonnegative entries, the low-rank approximation problem is well posed. In addition, due to the large dimension of the problem, the decomposition can be rather efficiently calculated with the help of preconditioned nonlinear conjugate gradient algorithms, as subsequently shown, if equipped with an algebraic calculation of the globally optimal stepsize in low dimension. Other algorithms are also studied (gradient and quasi-Newton approaches) for comparisons. Two versions of each algorithm are considered: the Enhanced Line Search version (ELS), and the backtracking version alternating with ELS. Computer simulations are provided and demonstrate the good behavior of these algorithms dedicated to nonnegative arrays, compared to others put forward in the literature. Finally, applications in the context of data analysis illustrate various algorithms. The main advantage of the suggested approach is to explicitly take into account the nonnegative nature of the loading matrices in the problem parameterization, instead of enforcing positive entries by projection. According to the experiments we have run, such an approach also happens to be more robust with respect to possible modeling errors.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00618729
Contributor : Pierre Comon <>
Submitted on : Friday, September 2, 2011 - 4:26:03 PM
Last modification on : Wednesday, October 14, 2020 - 1:56:08 PM
Long-term archiving on: : Saturday, December 3, 2011 - 2:26:45 AM

Files

artRTC-v13.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Philip Royer, Nadège Thirion-Moreau, Pierre Comon. Computing the polyadic decomposition of nonnegative third order tensors. Signal Processing, Elsevier, 2011, 91 (9), pp.2159-2171. ⟨10.1016/j.sigpro.2011.03.006⟩. ⟨hal-00618729⟩

Share

Metrics

Record views

742

Files downloads

771