Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
ESAIM: PS, 19 (2015) 115-134
Published online: 2015-06-24
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Computational lower bounds for graphon estimation via low-degree polynomials
Yuetian Luo and Chao GaoThe Annals of Statistics 52 (5) (2024)
https://doi.org/10.1214/24-AOS2437
A goodness-of-fit test on the number of biclusters in a relational data matrix
Chihiro Watanabe and Taiji SuzukiAnnals of the Institute of Statistical Mathematics 75 (6) 979 (2023)
https://doi.org/10.1007/s10463-023-00869-3
Compressed spectral screening for large-scale differential correlation analysis with application in selecting Glioblastoma gene modules
Tianxi Li, Xiwei Tang and Ajay ChatrathThe Annals of Applied Statistics 17 (4) (2023)
https://doi.org/10.1214/23-AOAS1771
Informative core identification in complex networks
Ruizhong Miao and Tianxi LiJournal of the Royal Statistical Society Series B: Statistical Methodology 85 (1) 108 (2023)
https://doi.org/10.1093/jrsssb/qkac009
On Support Recovery With Sparse CCA: Information Theoretic and Computational Limits
Nilanjana Laha and Rajarshi MukherjeeIEEE Transactions on Information Theory 69 (3) 1695 (2023)
https://doi.org/10.1109/TIT.2022.3214201
Tensor clustering with planted structures: Statistical optimality and computational limits
Yuetian Luo and Anru R. ZhangThe Annals of Statistics 50 (1) (2022)
https://doi.org/10.1214/21-AOS2123
Computational barriers to estimation from low-degree polynomials
Tselil Schramm and Alexander S. WeinThe Annals of Statistics 50 (3) (2022)
https://doi.org/10.1214/22-AOS2179
The overlap gap property in principal submatrix recovery
David Gamarnik, Aukosh Jagannath and Subhabrata SenProbability Theory and Related Fields 181 (4) 757 (2021)
https://doi.org/10.1007/s00440-021-01089-7
Connection Between the Selection Problem for a Sparse Submatrix of a Large-Size Matrix and the Bayesian Problem of Hypotheses Testing
I. A. Suslina and O. V. SokolovJournal of Mathematical Sciences 244 (5) 903 (2020)
https://doi.org/10.1007/s10958-020-04662-y
44 (2019)
https://doi.org/10.1145/3292500.3330916
Variable selection with Hamming loss
Cristina Butucea, Mohamed Ndaoud, Natalia A. Stepanova and Alexandre B. TsybakovThe Annals of Statistics 46 (5) (2018)
https://doi.org/10.1214/17-AOS1572
Information Limits for Recovering a Hidden Community
Bruce Hajek, Yihong Wu and Jiaming XuIEEE Transactions on Information Theory 63 (8) 4729 (2017)
https://doi.org/10.1109/TIT.2017.2653804
Recovering block-structured activations using compressive measurements
Sivaraman Balakrishnan, Mladen Kolar, Alessandro Rinaldo and Aarti SinghElectronic Journal of Statistics 11 (1) (2017)
https://doi.org/10.1214/17-EJS1267
1894 (2016)
https://doi.org/10.1109/ISIT.2016.7541628