Detection of a sparse submatrix of a high-dimensional noisy matrix
Authors:
- Cristina ButuceaCBCristina Butucea
- Yuri I. IngsterYIYuri I. Ingster
Open Access
- 1 November 2013
- journal article
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 19 (5B) , 2652-2688
Abstract
Project Euclid - mathematics and statistics onlineKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrixBernoulli, 2013
- Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticismThe Annals of Statistics, 2011
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completionThe Annals of Statistics, 2011
- Detection of an anomalous cluster in a networkThe Annals of Statistics, 2011
- On combinatorial testing problemsThe Annals of Statistics, 2010
- Finding large average submatrices in high dimensional dataThe Annals of Applied Statistics, 2009
- Simultaneous analysis of Lasso and Dantzig selectorThe Annals of Statistics, 2009
- Near-Optimal Detection of Geometric Objects by Fast Multiscale MethodsIEEE Transactions on Information Theory, 2005
- Detection of a signal of known shape in a multichannel systemJournal of Mathematical Sciences, 2005
- Higher criticism for detecting sparse heterogeneous mixturesThe Annals of Statistics, 2004