Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy


We study in this paper computational and statistical boundaries for submatrix localization. Given one observation of (one or multiple non-overlapping) signal submatrix (of magnitude λ and size km×kn) embedded in a large noise matrix (of size m × n), the goal is to optimal identify the support of the signal submatrix computationally and statistically. Two… (More)


1 Figure or Table


Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics