The average number of critical rank-one approximations to a tensor
Optimization and Control
2017-10-10 v2 Algebraic Geometry
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.
Keywords
Cite
@article{arxiv.1408.3507,
title = {The average number of critical rank-one approximations to a tensor},
author = {Jan Draisma and Emil Horobet},
journal= {arXiv preprint arXiv:1408.3507},
year = {2017}
}
Comments
Several minor edits