arXiv (All)
open access
Fast Algorithms for Sparse PCA and Robust Sparse Estimation
We study fast algorithms for sparse-PCA certification. Given a positive semidefinite matrix $M$, the problem asks either to rule out a large $k$-sparse quadratic form or to return a high-value (relaxed) witness. The standard semidefinite relaxation provides such certificates, but existing general-pu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Linear algebra and its applications#18198
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
- Machine Learning Methods Through the Lens of Infinite-Dimensional Lasso#634850
- A Bounded Degree SOS Plus SONC Hierarchy for Polynomial Optimization#1061859
Record · ID 996529
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive