Skip to main content
top

Bibliography

Journal Article

Krylov-Levenberg-Marquardt Algorithm for Structured Tucker Tensor Decompositions

Tichavský Petr, Phan A. H., Cichocki A.

: IEEE Journal on Selected Topics in Signal Processing vol.15, 3 (2021), p. 550-559

: GA20-17720S, GA ČR

: canonical polyadic tensor decomposition, parallel factor analysis, tensor chain, sensitivity

: 10.1109/JSTSP.2021.3059521

: http://library.utia.cas.cz/separaty/2021/SI/tichavsky-0541614.pdf

: https://ieeexplore.ieee.org/document/9354901

(eng): Structured Tucker tensor decomposition models complete or incomplete multiway data sets (tensors), where the core tensor and the factor matrices can obey different constraints. The model includes block-term decomposition or canonical polyadic decomposition as special cases. We propose a very flexible optimization method for the structured Tucker decomposition problem, based on the second-order Levenberg-Marquardt optimization, using an approximation of the Hessian matrix by the Krylov subspace method. An algorithm with limited sensitivity of the decomposition is included. The proposed algorithm is shown to perform well in comparison to existing tensor decomposition methods.\n

: BB

: 20201