Pages that link to "Item:Q4682810"

The following pages link to Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization (Q4682810):

Displaying 20 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Fundamental limits of symmetric low-rank matrix estimation (Q1740590) (← links)
• Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• The all-or-nothing phenomenon in sparse linear regression (Q2078961) (← links)
• Sharp optimal recovery in the two component Gaussian mixture model (Q2091831) (← links)
• Consistency of invariance-based randomization tests (Q2091850) (← links)
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition (Q2131259) (← links)
• Statistical limits of spiked tensor models (Q2179237) (← links)
• Fundamental limits of detection in the spiked Wigner model (Q2196197) (← links)
• An information-percolation bound for spin synchronization on general graphs (Q2657904) (← links)
• Statistical thresholds for tensor PCA (Q2657928) (← links)
• Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← links)
• Subexponential-time algorithms for sparse PCA (Q6566150) (← 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)
• Estimating rank-one matrices with mismatched prior and noise: universality and large deviations (Q6659449) (← links)