120 citations · 122 across the 3 of their papers we have counts for
3 papers
Approximation Bounds for Sparse Programs
Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui
We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven…
Greedy Frank-Wolfe Algorithm for Exemplar Selection
Gary Cheng, Armin Askari, Kannan Ramchandran +1
In this paper, we consider the problem of selecting representatives from a data set for arbitrary supervised/unsupervised learning tasks. We identify a subset of a data set …
Model Selection Through Sparse Maximum Likelihood Estimation
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to…