Metraipolis › archive › dc_bcf92557c07b

A Random Matrix Analysis of Symmetric Tensor Unfolding — arXiv:2611.05137

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05137
License (as archived)
CC0-1.0
Archived
2026-11-04T18:56:03.300Z
SHA-256 of the archived text
7bce6456d18da1d501be6c5d7ce5cb2be8ac0f7b8c167f7a1f97ae3a160d722e
Stable URL of this page
https://metraipolis.com/documento/dc_bcf92557c07b

How to cite

A Random Matrix Analysis of Symmetric Tensor Unfolding — arXiv:2611.05137 — arXiv (en), https://arxiv.org/abs/2611.05137 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bcf92557c07b (Metraipolis archive dc_bcf92557c07b, sha256 7bce6456d18da1d501be6c5d7ce5cb2be8ac0f7b8c167f7a1f97ae3a160d722e)
BibTeX
@misc{dcbcf92557c07b,
  title = {A Random Matrix Analysis of Symmetric Tensor Unfolding — arXiv:2611.05137},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05137},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bcf92557c07b; sha256 7bce6456d18da1d501be6c5d7ce5cb2be8ac0f7b8c167f7a1f97ae3a160d722e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05137. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study a fundamental problem in machine learning: partial recovery of a planted signal $\boldsymbol{v} \in \mathbb{S}^{n-1}$ from a spiked tensor $\boldsymbol{\mathsf{X}} = \lambda \, \boldsymbol{v}^{\otimes p} + \boldsymbol{\mathsf{Z}}$, where $\boldsymbol{\mathsf{Z}}$ has symmetric Gaussian entries of variance $\asymp n^{-1}$. While previous works replace $\boldsymbol{\mathsf{Z}}$ by an i.i.d. standard Gaussian tensor to circumvent technical difficulties caused by dependencies, this paper directly analyzes the symmetric model via random matrix theory. We show that the square unfolding algorithm is subject to a sharp phase transition for partial recovery at $\lambda \asymp n^{(p-2) / 4}$, validating an open conjecture from Montanari and Richard (2014). We get precise expressions for the limiting spectral distribution, deterministic equivalent, phase transition threshold and overlap. The main message is that unfolded symmetric tensors spectrally behave like standard Wigner matrices, up to simple transformations accounting for high-order symmetries. We consider extensions to multiple orthogonal spikes, recursive unfolding and non-square unfolding via disproportionate random matrix theory, leading to an interesting conjectured statistical-computational tradeoff regarding the choice of unfolding: square versus long.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.05137 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:35:37.547Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).