Fetching the paper…
Reading the bibliography…
The principal submatrix localization problem deals with recovering a $K\times K$ principal submatrix of elevated mean $\mu$ in a large $n\times n$ symmetric matrix subject to additive standard Gaussian noise.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Information Theory
R. B. Ash · 1965
Earlier work this paper cites.
Direct clustering of a data matrix
J. A. Hartigan · 1972
Earlier work this paper cites.
Perturbation bounds in connection with singular value decomposition
P. Wedin · 1972
Earlier work this paper cites.
Orthogonal polynomials
G. Szegö · 1975
Earlier work this paper cites.
Limit theorems of probability theory: Sequences of independent random variables
V. V. Petrov · 1995
Earlier work this paper cites.
A course in probability theory
K. Chung · 2001
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 2001
Earlier work this paper cites.
Local operator theory, random matrices and Banach spaces
K. Davidson and S. Szarek · 2001
Earlier work this paper cites.
Order Statistics
H. David and H. Nagaraja · 2003
Cited alongside, same era.
The largest eigenvalue of rank one deformation of large Wigner matrices
D. Féral and S. Péché · 2007
Cited alongside, same era.
Finding large average submatrices in high dimensional data
A. A. Shabalin, V. J. Weigman, C. M. Perou, and A. B. Nobel · 2009
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2010
Cited alongside, same era.
Minimax localization of structural information in large noisy matrices
M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh · 2011
Cited alongside, same era.
Detection of a sparse submatrix of a high-dimensional noisy matrix
C. Butucea and Y. I. Ingster · 2013
Belief propagation, robust reconstruction, and optimal recovery of block models (extended abstract)
E. Mossel, J. Neeman, and S. Sly · 2014
Later among the works it cites.
Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
C. Butucea, Y. Ingster, and I. Suslina · 2015
Closest in time.
Computational and statistical boundaries for submatrix localization in a large noisy matrix
T. T. Cai, T. Liang, and A. Rakhlin · 2015
Closest in time.
Optimal estimation and rank detection for sparse spiked covariance matrices
T. T. Cai, Z. Ma, and Y. Wu · 2015
Closest in time.
Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time
Y. Deshpande and A. Montanari · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The isotropic semicircle law and deformation of Wigner matrices
A. Knowles and J. Yin · 2013
Cited alongside, same era.
Y. Chen and J. Xu · 2014
Cited alongside, same era.
On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors
A. Montanari, D. Reichman, and O. Zeitouni · 2014
Cited alongside, same era.
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Semidefinite programs for exact recovery of a hidden community
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Computational barriers in minimax submatrix detection
Z. Ma and Y. Wu · 2015
Closest in time.
Consistency thresholds for the planted bisection model
E. Mossel, J. Neeman, and A. Sly · 2015
Closest in time.