Subexponential-time algorithms for sparse PCA

DOI10.1007/s10208-023-09603-0MaRDI QIDQ6566150

Yunzi Ding, Alexander S. Wein, Afonso S. Bandeira, Dmitriy Kunisky

Publication date: 3 July 2024

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexitysparse PCAlow-degree likelihood ratio

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Subexponential-time algorithms for sparse PCA