142 citations · 752 across the 110 of their papers we have counts for
6 papers · 2 filters
List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
We study the problem of list-decodable Gaussian mean estimation and the related problem of learning mixtures of separated spherical Gaussians. We develop a set of techniques that y…
Testing Conditional Independence of Discrete Distributions
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane +1
We study the problem of testing \emph{conditional independence} for discrete distributions. Specifically, given samples from a discrete random variable on domain $[\ell…
Sharp Bounds for Generalized Uniformity Testing
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution over an {\em unknown} d…
Robust polynomial regression up to the information theoretic limit
Daniel Kane, Sushrut Karmalkar, Eric Price
We consider the problem of robust polynomial regression, where one receives samples that are usually within of a polynomial , but have a chance of be…
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane +3
We study the fundamental problem of learning the parameters of a high-dimensional Gaussian in the presence of noise -- where an -fraction of our samples were chosen by…
Near-Optimal Closeness Testing of Discrete Histogram Distributions
Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin
We investigate the problem of testing the equivalence between two discrete histograms. A {\em -histogram} over is a probability distribution that is piecewise constant ove…