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

J. Draisma, E. Horobet

Research output: Book/ReportReportAcademic

94 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 formulas that relates this average to problems in random matrix theory.
Original languageEnglish
Publishers.n.
Number of pages19
Publication statusPublished - 2014

Publication series

NamearXiv.org
Volume1408.3507 [math.OC]

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