A Moment-Based Approach for Guaranteed Tensor Decomposition

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3927-3931
Number of pages5
ISBN (Electronic)9781509066315
DOIs
Publication statusPublished - 1 May 2020
Event2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020 - Barcelona, Spain
Duration: 4 May 20208 May 2020

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2020-May
ISSN (Print)1520-6149

Conference

Conference2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020
Country/TerritorySpain
CityBarcelona
Period4/05/208/05/20

Keywords

  • canonical polyadic decomposition
  • moment problem
  • tensors

Fingerprint

Dive into the research topics of 'A Moment-Based Approach for Guaranteed Tensor Decomposition'. Together they form a unique fingerprint.

Cite this