Pages that link to "Item:Q2352742"
From MaRDI portal
The following pages link to Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742):
Displaying 12 items.
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- The spectral norm of random inner-product kernel matrices (Q1729691) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications (Q3303137) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
