30 citations · 69 across the 11 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.LG2018
High-Dimensional Robust Mean Estimation in Nearly-Linear Time
Yu Cheng, Ilias Diakonikolas, Rong Ge
We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the fi…
cs.GT2018
A Simple Mechanism for a Budget-Constrained Buyer
Yu Cheng, Nick Gravin, Kamesh Munagala +1
We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with heterogeneou…
cs.LG2018
Non-Convex Matrix Completion Against a Semi-Random Adversary
Yu Cheng, Rong Ge
Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the cu…