59 citations · 139 across the 3 of their papers we have counts for
3 papers
cs.LG2015★ 59 cited
The Ladder: A Reliable Leaderboard for Machine Learning Competitions
Avrim Blum, Moritz Hardt
The organizer of a machine learning competition faces the problem of maintaining an accurate leaderboard that faithfully represents the quality of the best submission of each compe…
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…