72 citations · 542 across the 65 of their papers we have counts for
5 papers · 1 filter
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…
Linear Inverse Problems with Norm and Sparsity Constraints
Volkan Cevher, Sina Jafarpour, Anastasios Kyrillidis
We describe two nonconventional algorithms for linear regression, called GAME and CLASH. The salient characteristics of these approaches is that they exploit the convex -ba…
Structured Sparsity: Discrete and Convex approaches
Anastasios Kyrillidis, Luca Baldassarre, Marwa El-Halabi +2
Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance…
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…