activity
20002023
most citedImproved Bounds on Quantum Learning Algorithms

72 citations · 399 across the 60 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

cs.DS2011★ 49 cited

Testing -Modal Distributions: Optimal Algorithms via Reductions

Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio +2

We give highly efficient algorithms, and almost matching lower bounds, for a range of basic statistical problems that involve testing and estimating the L_1 distance between two k-…

cs.LG2011★ 13 cited

Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms

R. Khardon, D. Roth, R. A. Servedio

The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One m…

cs.CC2011

Private Data Release via Learning Thresholds

Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio

This work considers computationally efficient privacy-preserving data release. We study the task of analyzing a database containing sensitive information about individual participa…

cs.DS2011★ 2 cited

Learning Poisson Binomial Distributions

Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio

We consider a basic problem in unsupervised learning: learning an unknown \emph{Poisson Binomial Distribution}. A Poisson Binomial Distribution (PBD) over is the…

cs.LG2011

Learning transformed product distributions

Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio

We consider the problem of learning an unknown product distribution over using samples where is a \emph{known} transformation function. Each choice of a…