A statistical model for tensor PCA
Andrea Montanari, Emile Richard

TL;DR
This paper investigates the limits of tensor PCA under a single-spike model, establishing theoretical thresholds for optimal estimation and analyzing the computational feasibility of various algorithms.
Contribution
It provides necessary and sufficient conditions for principal component estimation and compares the performance of polynomial-time algorithms in tensor PCA.
Findings
Optimal signal-to-noise ratio threshold is proportional to √(k log k).
Polynomial-time algorithms fail unless the signal-to-noise ratio diverges.
Spectral initialization improves tensor power iteration performance.
Abstract
We consider the Principal Component Analysis problem for large tensors of arbitrary order under a single-spike (or rank-one plus noise) model. On the one hand, we use information theory, and recent results in probability theory, to establish necessary and sufficient conditions under which the principal component can be estimated using unbounded computational resources. It turns out that this is possible as soon as the signal-to-noise ratio becomes larger than (and in particular can remain bounded as the problem dimensions increase). On the other hand, we analyze several polynomial-time estimation algorithms, based on tensor unfolding, power iteration and message passing ideas from graphical models. We show that, unless the signal-to-noise ratio diverges in the system dimensions, none of these approaches succeeds. This is possibly related to a…
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.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Tensor decomposition and applications · Blind Source Separation Techniques
