Sensitivity in Tensor Decomposition

Petr Tichavský, Anh Huy Phan, Andrzej Cichocki

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)

    Abstract

    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 letter, we introduce a notion of sensitivity of CP decomposition and suggest to use it as a side criterion (besides the fitting error) to 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.

    Original languageEnglish
    Article number8846103
    Pages (from-to)1653-1657
    Number of pages5
    JournalIEEE Signal Processing Letters
    Volume26
    Issue number11
    DOIs
    Publication statusPublished - Nov 2019

    Fingerprint

    Dive into the research topics of 'Sensitivity in Tensor Decomposition'. Together they form a unique fingerprint.

    Cite this