Ústav teorie informace a automatizace

Jste zde

Bibliografie

Journal Article

Sensitivity in tensor decomposition

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

: IEEE Signal Processing Letters vol.26, 11 (2019), p. 1653-1657

: GA17-00902S, GA ČR

: PARAFAC, convolutive neural networks, tensor

: 10.1109/LSP.2019.2943060

: http://library.utia.cas.cz/separaty/2019/SI/tichavsky-0509948.pdf

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

(eng): Canonical polyadic (CP) tensor decomposition is an important task in many applications. Many times, the true tensor rank is not known, or noise is present, and in such situations, different existing CP decomposition algorithms provide very different results. In this paper, we introduce a notion of sensitivity of CP decomposition and suggest to use it as a side criterion (besides the fitting error)\nto evaluate different CP decomposition results. Next, we propose a novel variant of a Krylov-Levenberg-Marquardt CP decomposition algorithm which may serve for CP decomposition with a constraint on the sensitivity. In simulations, we decompose order-4 tensors that come from convolutional neural networks. We show that it is useful to combine the CP decomposition algorithms with an error-preserving correction.

: BB

: 20201

07.01.2019 - 08:39