Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Detection of a sparse submatrix of a high-dimensional noisy matrix

Abstract : We observe a $N\times M$ matrix $Y_{ij}=s_{ij}+\xi_{ij}$ with $\xi_{ij}\sim\CN(0,1)$ i.i.d. in $i,j$, and $s_{ij}\in\R$. We test the null hypothesis $s_{ij}=0$ for all $i,j$ against the alternative that there exists some submatrix of size $n\times m$ with significant elements in the sense that $s_{ij}\ge a>0$. We propose a test procedure and compute the asymptotical detection boundary $a$ so that the maximal testing risk tends to 0 as $M\to\infty,\ N\to\infty,\ p=n/N\to 0,\ q=m/M\to 0$. We prove that this boundary is asymptotically sharp minimax under some additional constraints. Relations with other testing problems are discussed. We propose a testing procedure which adapts to unknown $(n,m)$ within some given set and compute the adaptive sharp rates. The implementation of our test procedure on synthetic data shows excellent behavior for sparse, not necessarily squared matrices. We extend our sharp minimax results in different directions: first, to Gaussian matrices with unknown variance, next, to matrices of random variables having a distribution from an exponential family (non Gaussian) and, finally, to a two-sided alternative for matrices with Gaussian elements.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Cristina Butucea <>
Submitted on : Tuesday, September 11, 2012 - 3:37:34 PM
Last modification on : Thursday, March 19, 2020 - 12:26:02 PM
Long-term archiving on: : Friday, December 16, 2016 - 11:55:07 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00730966, version 1


Cristina Butucea, Yuri Ingster. Detection of a sparse submatrix of a high-dimensional noisy matrix. 2012. ⟨hal-00730966⟩



Record views


Files downloads