The landscape of the spiked tensor model
Gerard Ben Arous, Song Mei, Andrea Montanari, Mihai Nica

TL;DR
This paper analyzes the critical points of the maximum likelihood estimator in the spiked tensor model, revealing the landscape's structure and explaining the computational hardness of estimation in certain regimes.
Contribution
It provides exact formulas for the number of critical points and local maxima, and characterizes their locations relative to the true signal, elucidating the computational barriers.
Findings
Critical points are either near the true signal or in a band orthogonal to it.
The number of critical points grows exponentially with dimension.
Uninformative local maxima hinder optimization algorithms.
Abstract
We consider the problem of estimating a large rank-one tensor , in Gaussian noise. Earlier work characterized a critical signal-to-noise ratio above which an ideal estimator achieves strictly positive correlation with the unknown vector of interest. Remarkably no polynomial-time algorithm is known that achieved this goal unless and even powerful semidefinite programming relaxations appear to fail for . In order to elucidate this behavior, we consider the maximum likelihood estimator, which requires maximizing a degree- homogeneous polynomial over the unit sphere in dimensions. We compute the expected number of critical points and local maxima of this objective function and show that it is exponential in the dimensions , and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
