107 citations · 140 across the 9 of their papers we have counts for
3 papers · 1 filter
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…
On Approximating the Sum-Rate for Multiple-Unicasts
Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with …