Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.14329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915557466439680 |
|---|---|
| author | Ding, Shihong Gu, Yihong Liu, Yuanshi Fang, Cong |
| author_facet | Ding, Shihong Gu, Yihong Liu, Yuanshi Fang, Cong |
| contents | We study the Order-$k$ ($k \geq 4$) spiked tensor model for the tensor principal component analysis (PCA) problem: given $N$ i.i.d. observations of a $k$-th order tensor generated from the model $\mathbf{T} = λ\cdot v_*^{\otimes k} + \mathbf{E}$, where $λ> 0$ is the signal-to-noise ratio (SNR), $v_*$ is a unit vector, and $\mathbf{E}$ is a random noise tensor, the goal is to recover the planted vector $v_*$.
We propose a normalized stochastic gradient ascent (NSGA) method with overparameterization for solving the tensor PCA problem. Without any global (or spectral) initialization step, the proposed algorithm successfully recovers the signal $v_*$ when $Nλ^2 \geq \widetildeΩ(d^{\lceil k/2 \rceil})$, thereby breaking the previous conjecture that (stochastic) gradient methods require at least $Ω(d^{k-1})$ samples for recovery. For even $k$, the $\widetildeΩ(d^{k/2})$ threshold coincides with the optimal threshold under computational constraints, attained by sum-of-squares relaxations and related algorithms. Theoretical analysis demonstrates that the overparameterized stochastic gradient method not only establishes a significant initial optimization advantage during the early learning phase but also achieves strong generalization guarantees. This work provides the first evidence that overparameterization improves statistical performance relative to exact parameterization that is solved via standard continuous optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_14329 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Near-Optimal Tensor PCA via Normalized Stochastic Gradient Ascent with Overparameterization Ding, Shihong Gu, Yihong Liu, Yuanshi Fang, Cong Optimization and Control We study the Order-$k$ ($k \geq 4$) spiked tensor model for the tensor principal component analysis (PCA) problem: given $N$ i.i.d. observations of a $k$-th order tensor generated from the model $\mathbf{T} = λ\cdot v_*^{\otimes k} + \mathbf{E}$, where $λ> 0$ is the signal-to-noise ratio (SNR), $v_*$ is a unit vector, and $\mathbf{E}$ is a random noise tensor, the goal is to recover the planted vector $v_*$. We propose a normalized stochastic gradient ascent (NSGA) method with overparameterization for solving the tensor PCA problem. Without any global (or spectral) initialization step, the proposed algorithm successfully recovers the signal $v_*$ when $Nλ^2 \geq \widetildeΩ(d^{\lceil k/2 \rceil})$, thereby breaking the previous conjecture that (stochastic) gradient methods require at least $Ω(d^{k-1})$ samples for recovery. For even $k$, the $\widetildeΩ(d^{k/2})$ threshold coincides with the optimal threshold under computational constraints, attained by sum-of-squares relaxations and related algorithms. Theoretical analysis demonstrates that the overparameterized stochastic gradient method not only establishes a significant initial optimization advantage during the early learning phase but also achieves strong generalization guarantees. This work provides the first evidence that overparameterization improves statistical performance relative to exact parameterization that is solved via standard continuous optimization. |
| title | Near-Optimal Tensor PCA via Normalized Stochastic Gradient Ascent with Overparameterization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.14329 |