A Moment-Based Approach for Guaranteed Tensor Decomposition
Arthur Marmin, Marc Castella, Jean-Christophe Pesquet
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.
BibTeX
@inproceedings{icassp2020_amomentbasedappr,
title = {A Moment-Based Approach for Guaranteed Tensor Decomposition},
author = {Arthur Marmin and Marc Castella and Jean-Christophe Pesquet},
booktitle = {ICASSP 2020},
year = {2020}
}