Pages that link to "Item:Q2403425"
From MaRDI portal
The following pages link to Computational and statistical boundaries for submatrix localization in a large noisy matrix (Q2403425):
Displaying 17 items.
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- A sieve stochastic gradient descent estimator for online nonparametric regression in Sobolev ellipsoids (Q2105198) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
- Distribution-free detection of a submatrix (Q2400812) (← links)
- Estimation of Wasserstein distances in the spiked transport model (Q2676937) (← links)
- Parallel tempering for the planted clique problem (Q3303299) (← links)
- Submatrix localization via message passing (Q4558513) (← links)
- Distribution-Free, Size Adaptive Submatrix Detection with Acceleration (Q5110726) (← links)
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising (Q5381114) (← 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)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
- The landscape of the planted clique problem: dense subgraphs and the overlap gap property (Q6616866) (← links)
- Fundamental limits of low-rank matrix estimation with diverging aspect ratios (Q6621532) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
