Stochastic Gradient Descent in High Dimensions for Multi‐Spiked Tensor PCA

ABSTRACT We study the high‐dimensional dynamics of online stochastic gradient descent (SGD) for the multi‐spiked tensor model. This multi‐index model arises from the tensor principal component analysis (PCA) problem with multiple spikes, where the goal is to estimate the unknown signal vectors within the ‐dimensional unit sphere through maximum likelihood estimation from noisy observations of a ‐tensor. We determine the number of samples and the conditions on the signal‐to‐noise ratios (SNRs) required to efficiently recover the unknown spikes from natural random initializations. We show that full recovery of all spikes is possible provided a number of sample scaling as , matching the algorithmic threshold identified in the rank‐one case. Our results are obtained through a detailed analysis of a low‐dimensional system that describes the evolution of the correlations between the estimators and the spikes, while sharply controlling the noise in the dynamics. We find the spikes are recovered sequentially in a process we term “sequential elimination”: once a correlation exceeds a critical threshold, all correlations sharing a row or column index become sufficiently small, allowing the next correlation to grow and become macroscopic. The order in which correlations become macroscopic depends on their initial values and the corresponding SNRs, leading to either exact recovery or recovery of a permutation of the spikes. In the matrix case, when , if the SNRs are sufficiently separated, we achieve exact recovery of the spikes, whereas equal SNRs lead to recovery of the subspace spanned by them.