Ilias Diakonikolas
University of Wisconsin-Madison
286 Papers
3.2K Citations
Ilias Diakonikolas is an academic researcher from University of Wisconsin-Madison. The author has contributed to research in topics: Computer science & Upper and lower bounds. The author has an hindex of 47, co-authored 245 publications. Previous affiliations of Ilias Diakonikolas include University of Edinburgh & University of California, Berkeley.
Chat about Author
Papers
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
TL;DR: It is shown that for a broad class of biobjective problems, one can compute in polynomial time an $\epsilon$-Pareto set that contains at most twice as many solutions as the minimum set, and that the factor of 2 is tight for these problems.
89
Learning Poisson Binomial Distributions
TL;DR: In this article, the authors considered the problem of learning an unknown Poisson binomial distribution with respect to the total variation distance, and gave an algorithm with running time of quasilinear in the size of its input data.
87
•Posted Content
Bounded Independence Fools Halfspaces
TL;DR: The authors showed that any distribution on {-1, 1} n that is k-wise independent can fool any halfspace h with error eps and seed length s = k \log n = O(log n \cdot \log^2(1/\eps) /\eps^2).
86
•Posted Content
Bounded Independence Fools Degree-2 Threshold Functions
TL;DR: A broad class of explicit pseudorandom generators against degree-$2$ boolean threshold functions is given, as long as $\mathcal{D}$ is a $k$-wise independent distribution over $\bits^n$ for $k = \poly(1/\eps)$.
84
•Journal Article
A New Approach for Testing Properties of Discrete Distributions.
TL;DR: In this paper, a modular reduction-based approach was proposed to obtain sample-optimal testers for a wide range of distribution properties, including identity testing to a fixed distribution, closeness testing between two unknown distributions, independence testing, and histogram testing.
83