1.9k citations · 3.1k across the 6 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.LG2014★ 23 cited
Preventing False Discovery in Interactive Data Analysis is Hard
Moritz Hardt, Jonathan Ullman
We show that, under a standard hardness assumption, there is no computationally efficient algorithm that given samples from an unknown distribution can give valid answers to $n…
cs.LG2014★ 57 cited
Fast matrix completion without the condition number
Moritz Hardt, Mary Wootters
We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the ma…
cs.LG2014★ 1 cited
Tight bounds for learning a mixture of two gaussians
Moritz Hardt, Eric Price
We consider the problem of identifying the parameters of an unknown mixture of two arbitrary -dimensional gaussians from a sequence of independent random samples. Our main resul…