Journal of Mathematical Sciences

, Volume 244, Issue 5, pp 903–911 | Cite as

Connection Between the Selection Problem for a Sparse Submatrix of a Large-Size Matrix and the Bayesian Problem of Hypotheses Testing

  • I. A. SuslinaEmail author
  • O. V. Sokolov

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.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Butucea, Y. I. Ingster, and I. A. Suslina, “Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix,” ESAIM: Probab. and Statist., 19, 115–134 (2015).MathSciNetCrossRefGoogle Scholar
  2. 2.
    M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh, “Minimax localization of structural information in large noisy matrices,” NIPS (2011).Google Scholar
  3. 3.
    C. Butucea and Y. I. Ingster, “Detection of a sparse submatrix of a high-dimensional noisy matrix,” Bernoulli, 19, No. 5B (2013), 2652–2688 (2012).MathSciNetCrossRefGoogle Scholar
  4. 4.
    C. Butucea and G. Gayraud, “Sharp detection of smooth signals in a high-dimensional sparse matrix with indirect observations,” Ann. Inst. H. Poincaré Probab. Statist., 52, 1564–1591 (2016).MathSciNetCrossRefGoogle Scholar
  5. 5.
    X. Sun and A. B. Nobel, “On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix,” Bernoulli, 19, 275–294 (2013).MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2020

Authors and Affiliations

  1. 1.St. Petersburg National Research University of Information Technologies, Mechanics, and OpticsSt. PetersburgRussia
  2. 2.McKinsey and CompanyMoscowRussia

Personalised recommendations