# Distribution-Free, Size Adaptive Submatrix Detection with Acceleration

arXiv: https://arxiv.org/abs/1804.10887 · HTML: https://mlsanity.com/paper/1804.10887/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Apr 2018.

## Built on by (most cited first, 1 of 1)

- [A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix](https://mlsanity.com/paper/2102.11658/) (2021)

## Abstract (arXiv)

Given a large matrix containing independent data entries, we consider the problem of detecting a submatrix inside the data matrix that contains larger-than-usual values. Different from previous literature, we do not have exact information about the dimension of the potential elevated submatrix. We propose a Bonferroni type testing procedure based on permutation tests, and show that our proposed test loses no first-order asymptotic power compared to tests with full knowledge of potential elevated submatrix. In order to speed up the calculation during the test, an approximation net is constructed and we show that Bonferroni type permutation test on the approximation net loses no power on the first order asymptotically.