# On The Non-Detectability of Spiked Large Random Tensors

@article{Chevreuil2018OnTN, title={On The Non-Detectability of Spiked Large Random Tensors}, author={Antoine Chevreuil and Philippe Loubaton}, journal={2018 IEEE Statistical Signal Processing Workshop (SSP)}, year={2018}, pages={443-447} }

This paper addresses the detection of a low rank high-dimensional tensor corrupted by an additive complex Gaussian noise. In the asymptotic regime where all the dimensions of the tensor converge towards $+\infty $ at the same rate, existing results devoted to rank 1 tensors are extended. It is proved that if a certain parameter depending explicitly on the low rank tensor is below a threshold, then the null hypothesis and the presence of the low rank tensor are undistinguishable hypotheses in… Expand

#### Figures and Topics from this paper

#### 2 Citations

A Random Matrix Perspective on Random Tensors

- Computer Science, Mathematics
- ArXiv
- 2021

A sharply distinct approach to study the spectra of random matrices arising from contractions of a given random tensor, which yields a hitherto unknown characterization of the local maximum of the ML problem that is global above the phase transition threshold. Expand

On the detection of low rank matrices in the high-dimensional regime

- Engineering, Mathematics
- 2018 26th European Signal Processing Conference (EUSIPCO)
- 2018

A contrario is proved that under the condition of the largest singular value of the rank 1 matrices,lambda_{1}(X}_{0) < 1, there are no consistent tests. Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

Statistical limits of spiked tensor models

- Mathematics, Computer Science
- ArXiv
- 2016

The replica prediction from statistical physics is conjectured to give the exact information-theoretic threshold for any fixed $d$, and a new improvement to the second moment method for contiguity is introduced, on which the lower bounds are based. Expand

A statistical model for tensor PCA

- Computer Science, Mathematics
- NIPS
- 2014

It turns out that the Principal Component Analysis problem for large tensors of arbitrary order $k$ under a single-spike (or rank-one plus noise) model is possible as soon as the signal-to-noise ratio $\beta$ becomes larger than $C\sqrt{k\log k}$ (and in particular $\beta can remain bounded as the problem dimensions increase). Expand

Statistical and computational phase transitions in spiked tensor estimation

- Mathematics, Computer Science
- 2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

The performance of Approximate Message Passing is studied and it is shown that it achieves the MMSE for a large set of parameters, and that factorization is algorithmically “easy” in a much wider region than previously believed. Expand

On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2017

A lower bound on the critical signal-to-noise ratio below which a rank-one signal cannot be detected is established on the basis of a more general result on rank- one perturbations of the Gaussian tensors. Expand

Phase transition in the spiked random tensor with Rademacher prior

- Mathematics, Computer Science
- The Annals of Statistics
- 2019

This work identifies the signal-to-noise criticality $\beta_p$ as the critical temperature, distinguishing the high and low temperature behavior, of the Ising pure $p$-spin mean-field spin glass model. Expand

Sample Eigenvalue Based Detection of High-Dimensional Signals in White Noise Using Relatively Few Samples

- Mathematics, Computer Science
- IEEE Transactions on Signal Processing
- 2008

A fundamental asymptotic limit of sample-eigenvalue-based detection of weak or closely spaced high-dimensional signals from a limited sample size is highlighted; this motivates the heuristic definition of the effective number of identifiable signals which is equal to the number of ldquosignalrdquo eigenvalues of the population covariance matrix. Expand

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2018

The upper bounds show that for each of these problems there is a significant regime where reliable detection is information-theoretically possible but where known algorithms such as PCA fail completely, since the spectrum of the observed matrix is uninformative. Expand

The singular values and vectors of low rank perturbations of large rectangular random matrices

- Computer Science, Mathematics
- J. Multivar. Anal.
- 2012

This paper proves almost sure convergence of the extreme singular values and appropriate projections of the corresponding singular vectors of the perturbed matrix and examines the consequence of this singular value phase transition on the associated left and right singular eigenvectors. Expand

Tensor principal component analysis via sum-of-square proofs

- Mathematics, Computer Science
- COLT
- 2015

It is shown that degree-$4 sum-of-squares relaxations break down for $\tau \leq O(n^{3/4}/\log(n)^{1/4})$, which demonstrates that improving the current guarantees would require new techniques or might even be intractable. Expand

Performance of Statistical Tests for Single-Source Detection Using Random Matrix Theory

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2011

A unified framework for the detection of a single source with a sensor array in the context where the noise variance and the channel between the source and the sensors are unknown at the receiver is introduced. Expand