ResearchTrend.AI
A greedy anytime algorithm for sparse PCA
v1v2v3v4v5 (latest)

A greedy anytime algorithm for sparse PCA

Guy Holtzman
Adam Soffer
Dan Vilenchik
ArXiv (abs)PDFHTML

Papers citing "A greedy anytime algorithm for sparse PCA"

4 / 4 papers shown
Title
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
Afonso S. Bandeira
A. Alaoui
Samuel B. Hopkins
T. Schramm
Alexander S. Wein
Ilias Zadik
93
34
0
19 May 2022
Computational Barriers to Estimation from Low-Degree Polynomials
Computational Barriers to Estimation from Low-Degree Polynomials
T. Schramm
Alexander S. Wein
73
67
0
05 Aug 2020
Free Energy Wells and Overlap Gap Property in Sparse PCA
Free Energy Wells and Overlap Gap Property in Sparse PCA
Gerard Ben Arous
Alexander S. Wein
Ilias Zadik
73
34
0
18 Jun 2020
Subexponential-Time Algorithms for Sparse PCA
Subexponential-Time Algorithms for Sparse PCA
Yunzi Ding
Dmitriy Kunisky
Alexander S. Wein
Afonso S. Bandeira
177
63
0
26 Jul 2019