72 citations · 542 across the 65 of their papers we have counts for
3 papers · 2 filters
Dropping Convexity for Faster Semi-definite Optimization
Srinadh Bhojanapalli, Anastasios Kyrillidis, Sujay Sanghavi
We study the minimization of a convex function over the set of positive semi-definite matrices, but when the problem is recast as , wi…
Sparse PCA via Bipartite Matchings
Megasthenis Asteris, Dimitris Papailiopoulos, Anastasios Kyrillidis +1
We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly…
Stay on path: PCA along graph paths
Megasthenis Asteris, Anastasios Kyrillidis, Alexandros G. Dimakis +2
We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acycli…