Connection Between the Selection Problem for a Sparse Submatrix of a Large-Size Matrix and the Bayesian Problem of Hypotheses Testing
We associate the selection problem for a sparse submatrix of a matrix of large dimension and the problem of testing the hypothesis of the existence of a sparse submatrix possessing the required properties with the Bayesian hypothesis testing problem.
Unable to display preview. Download preview PDF.
- 2.M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh, “Minimax localization of structural information in large noisy matrices,” NIPS (2011).Google Scholar