Pages that link to "Item:Q2435256"

The following pages link to Detection of a sparse submatrix of a high-dimensional noisy matrix (Q2435256):

Displaying 37 items.

• Sparse Sliced Inverse Regression Via Lasso (Q152378) (← links)
• Higher criticism for large-scale inference, especially for rare and weak effects (Q254401) (← links)
• Optimal detection of sparse principal components in high dimension (Q385763) (← links)
• Adaptive sensing performance lower bounds for sparse signal detection and support estimation (Q470072) (← links)
• Comment on ``Hypothesis testing by convex optimization'' (Q491382) (← links)
• The sparse Poisson means model (Q887263) (← links)
• Community detection in sparse random networks (Q894814) (← links)
• To the memory of Yu. I. Ingster (Q906001) (← links)
• Detection of a sparse variable function (Q906769) (← links)
• Multidimensional two-component Gaussian mixtures detection (Q1650120) (← links)
• Optimal change point detection in Gaussian processes (Q1681057) (← links)
• Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
• Multiscale scanning in inverse problems (Q1990595) (← links)
• Detecting a planted community in an inhomogeneous random graph (Q2040057) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Optimal inference with a multidimensional multiscale statistic (Q2074288) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Uniform estimation in stochastic block models is slow (Q2137819) (← links)
• Fast nonasymptotic testing and support recovery for large sparse Toeplitz covariance matrices (Q2140845) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Multidimensional multiscale scanning in exponential families: limit theory and statistical consequences (Q2196187) (← links)
• Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
• Connection between the selection problem for a sparse submatrix of a large-size matrix and the Bayesian problem of hypotheses testing (Q2199139) (← links)
• Optimal testing for planted satisfiability problems (Q2259537) (← links)
• High-dimensional change-point detection under sparse alternatives (Q2313279) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• Energy landscape for large average submatrix detection problems in Gaussian random matrices (Q2363657) (← links)
• Distribution-free detection of a submatrix (Q2400812) (← links)
• Community detection in dense random networks (Q2510823) (← links)
• Sharp detection boundaries on testing dense subhypergraph (Q2676927) (← links)
• Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix (Q2786472) (← links)
• Submatrix localization via message passing (Q4558513) (← links)
• Distribution-Free, Size Adaptive Submatrix Detection with Acceleration (Q5110726) (← links)
• A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)
• Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← links)
• Testing correlation of unlabeled random graphs (Q6109918) (← links)
• Detecting structured signals in Ising models (Q6126097) (← links)