#### Filter Results:

- Full text PDF available (54)

#### Publication Year

2007

2018

- This year (20)
- Last 5 years (55)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ilias Diakonikolas, Mihalis Yannakakis
- APPROX-RANDOM
- 2007

We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy 2 the Pareto curve of a multiobjective optimization problem. We show that for a broadâ€¦ (More)

- Siu-on Chan, Ilias Diakonikolas, Paul Valiant, Gregory Valiant
- SODA
- 2014

We study the question of closeness testing for two discrete distributions. More precisely, given samples from two distributions p and q over an n-element set, we wish to distinguish whether p = qâ€¦ (More)

- Ilias Diakonikolas, Daniel M. Kane
- 2016 IEEE 57th Annual Symposium on Foundations ofâ€¦
- 2016

We study problems in distribution property testing: Given sample access to one or more unknown discrete distributions, we want to determine whether they have some global property or are epsilon-farâ€¦ (More)

- Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We show that any distribution on $\pmo^n$ that is $k$-wise independent fools any halfspace (a.k.a.~threshold) $h : \pmo^n \to \pmo$, i.e., any function of the form $h(x) = \sign(\sum_{i = 1}^n w_iâ€¦ (More)

- Ilias Diakonikolas, Homin K. Lee, +4 authors Andrew Wan
- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 2007

We describe a general method for testing whether a function on n input variables has a concise representation. The approach combines ideas from the junta test of Fischer et al. 16 with ideas fromâ€¦ (More)

- Ilias Diakonikolas, Mihalis Yannakakis
- SODA
- 2008

We study the succinct approximation of convex Pareto curves of multiobjective optimization problems. We propose the concept of Îµ-convex Pareto (Îµ-CP) set as the appropriate one for the convexâ€¦ (More)

- Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
- 2017 IEEE 58th Annual Symposium on Foundations ofâ€¦
- 2016

We describe a general technique that yields the first Statistical Query lower bounds} fora range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main resultsâ€¦ (More)

- Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio
- Algorithmica
- 2012

We consider a basic problem in unsupervised learning: learning an unknown Poisson Binomial Distribution. A Poisson Binomial Distribution (PBD) over {0,1,...,n} is the distribution of a sum of nâ€¦ (More)

We give a computationally efficient semi-agnostic algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let <i>p</i> be anâ€¦ (More)

- Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca, Luca P. Carloni
- 2011 48th ACM/EDAC/IEEE Design Automationâ€¦
- 2011

Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivity for multi-coreâ€¦ (More)