Pages that link to "Item:Q2786472"
From MaRDI portal
The following pages link to Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix (Q2786472):
Displaying 10 items.
- Variable selection with Hamming loss (Q1800786) (← links)
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Connection between the selection problem for a sparse submatrix of a large-size matrix and the Bayesian problem of hypotheses testing (Q2199139) (← links)
- Detecting positive correlations in a multivariate sample (Q2345119) (← links)
- Submatrix localization via message passing (Q4558513) (← links)
- A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)
- Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules (Q6138655) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
