274 citations · 3.1k across the 75 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 73 cited
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
Sanjeev Arora, Rong Ge, Ankur Moitra
In sparse recovery we are given a matrix (the dictionary) and a vector of the form where is sparse, and the goal is to recover . This is a central notion in signal…
cs.DS2013
Towards a better approximation for sparsest cut?
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
We give a new -approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size expand by a factor $\sqr…