Sparse PCA: algorithms, adversarial perturbations and certificates

DOI10.1109/FOCS46700.2020.00058MaRDI QIDQ6943998zbMATH OpenFDO

Authors David Steurer, Gleb Novikov, Pravesh Kothari, Tommaso d'Orsi

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00058

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Certifying Euclidean sections and finding planted sparse vectors beyond the \(\sqrt{n}\) dimension threshold
• Optimal spectral recovery of a planted vector in a subspace
• SQ lower bounds for random sparse planted vector problem

This page was built for publication: Sparse PCA: algorithms, adversarial perturbations and certificates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943998)