A moment-based approach for guaranteed tensor decomposition - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

A moment-based approach for guaranteed tensor decomposition

Abstract

This paper presents a new scheme to perform the canonical polyadic decomposition (CPD) of a symmetric tensor. We first formulate the CPD problem as a truncated moment problem , where a measure has to be recovered knowing some of its moments. The support of the measure is discrete and encodes the CPD. The support is then retrieved by solving a polynomial system. Using algebraic results, our method resorts only to classical linear algebra operations (eigenvalue method and Schur reordered factorization). This new viewpoint offers theoretical guarantees on the retrieved decomposition. Finally experimental results show the validity of our method and a better reconstruction accuracy compared to classic CPD algorithms .
Fichier principal
Vignette du fichier
icassp2020.pdf (228.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02654329 , version 1 (29-05-2020)

Identifiers

Cite

Arthur Marmin, Marc Castella, Jean-Christophe Pesquet. A moment-based approach for guaranteed tensor decomposition. ICASSP 2020 - 45th International Conference on Acoustics, Speech and Signal Processing, May 2020, Barcelona, Spain. pp.3927-3931, ⟨10.1109/icassp40776.2020.9054186⟩. ⟨hal-02654329⟩
121 View
143 Download

Altmetric

Share

Gmail Facebook X LinkedIn More