165 citations · 950 across the 71 of their papers we have counts for
4 papers · 1 filter
Smoothed Analysis of Tensor Decompositions
Aditya Bhaskara, Moses Charikar, Ankur Moitra +1
Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. Howev…
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…
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
Constantinos Daskalakis, Anindya De, Ilias Diakonikolas +2
We consider a problem which has received considerable attention in systems literature because of its applications to routing in delay tolerant networks and replica placement in dis…
A Polynomial Time Algorithm for Lossy Population Recovery
Ankur Moitra, Michael Saks
We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of leng…