The average number of critical rank-one approximations to a tensor

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
87 Downloads (Pure)

Abstract

Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we average over v drawn from a Gaussian distribution, and find a formula that relates this average to problems in random matrix theory.

Original languageEnglish
Pages (from-to)2498-2518
Number of pages21
JournalLinear and Multilinear Algebra
Volume64
Issue number12
DOIs
Publication statusPublished - 1 Dec 2016

Keywords

  • optimisation
  • random tensors
  • rank-one tensors

Fingerprint

Dive into the research topics of 'The average number of critical rank-one approximations to a tensor'. Together they form a unique fingerprint.

Cite this