Distribution-Free, Size Adaptive Submatrix Detection with Acceleration
From MaRDI portal
Publication:5110726
zbMath1442.62093arXiv1804.10887MaRDI QIDQ5110726
Publication date: 21 May 2020
Full work available at URL: https://arxiv.org/abs/1804.10887
Nonparametric hypothesis testing (62G10) Basic linear algebra (15A99) Statistical aspects of big data and data science (62R07)
Related Items
Cites Work
- Unnamed Item
- Consistency thresholds for the planted bisection model
- Finding large average submatrices in high dimensional data
- Probability inequalities for the sum in sampling without replacement
- Computational barriers in minimax submatrix detection
- Distribution-free detection of a submatrix
- Computational and statistical boundaries for submatrix localization in a large noisy matrix
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Community detection in dense random networks
- Concentration inequalities for sampling without replacement
- Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
- Exact Recovery in the Stochastic Block Model
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Submatrix localization via message passing
- Distribution-Free Detection of Structured Anomalies: Permutation and Rank-Based Scans
- Convex biclustering
- Information Limits for Recovering a Hidden Community
