107 citations · 140 across the 9 of their papers we have counts for
3 papers · 1 filter
A simple and provable algorithm for sparse diagonal CCA
Megasthenis Asteris, Anastasios Kyrillidis, Oluwasanmi Koyejo +1
Given two sets of variables, derived from a common set of samples, sparse Canonical Correlation Analysis (CCA) seeks linear combinations of a small number of variables in each set,…
Trading-off variance and complexity in stochastic gradient descent
Vatsal Shah, Megasthenis Asteris, Anastasios Kyrillidis +1
Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stoc…
Bipartite Correlation Clustering -- Maximizing Agreements
Megasthenis Asteris, Anastasios Kyrillidis, Dimitris Papailiopoulos +1
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreement…