3 papers
cs.DS2019★ 1 cited
Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
Moses Charikar, Kirankumar Shiragur, Aaron Sidford
Estimating symmetric properties of a distribution, e.g. support size, coverage, entropy, distance to uniformity, are among the most fundamental problems in algorithmic statistics.…
cs.HC2016
Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction
Jacob Steinhardt, Gregory Valiant, Moses Charikar
We consider a crowdsourcing model in which workers are asked to rate the quality of items previously generated by other workers. An unknown set of workers generate rel…
cs.CC2015
The Hardness of Approximation of Euclidean k-means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy +1
The Euclidean -means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry commun…