On the limitation of spectral methods: From the Gaussian hidden clique
problem to rank one perturbations of Gaussian tensors

On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors

22 November 2014

Andrea Montanari

Daniel Reichman

Ofer Zeitouni

ArXiv (abs)PDF HTML

Papers citing "On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors"

9 / 9 papers shown

Title
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 103 61 0 26 Jul 2019
Submatrix localization via message passing Bruce Hajek Yihong Wu Jiaming Xu 51 27 0 30 Oct 2015
A statistical model for tensor PCA Andrea Montanari E. Richard 81 266 0 04 Nov 2014
Computational barriers in minimax submatrix detection Zongming Ma Yihong Wu 210 152 0 23 Sep 2013
Asymptotic power of sphericity tests for high-dimensional data A. Onatski Marcelo J. Moreira Marc Hallin 83 149 0 20 Jun 2013
$Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time$ Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time Y. Deshpande Andrea Montanari 120 66 0 26 Apr 2013
Energy Landscape for large average submatrix detection problems in Gaussian random matrices S. Bhamidi P. Dey A. Nobel 70 20 0 10 Nov 2012
On combinatorial testing problems L. Addario-Berry N. Broutin Luc Devroye Gábor Lugosi 115 114 0 24 Aug 2009
A Spectral Algorithm for Learning Hidden Markov Models Daniel J. Hsu Sham Kakade Tong Zhang 183 309 0 26 Nov 2008

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.