Ilias Diakonikolas

According to our database1, Ilias Diakonikolas authored at least 78 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications).
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Efficient Algorithms and Lower Bounds for Robust Linear Regression.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

High-Dimensional Robust Mean Estimation in Nearly-Linear Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Sever: A Robust Meta-Algorithm for Stochastic Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
The complexity of optimal multidimensional pricing for a unit-demand buyer.
Games and Economic Behavior, 2018

Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications).
Electronic Colloquium on Computational Complexity (ECCC), 2018

Learning geometric concepts with nasty noise.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

List-decodable robust mean estimation and learning mixtures of spherical gaussians.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Testing conditional independence of discrete distributions.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Robustly Learning a Gaussian: Getting Optimal Error, Efficiently.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Testing for Families of Distributions via the Fourier Transform.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Sharp Bounds for Generalized Uniformity Testing.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Robust Learning of Fixed-Structure Bayesian Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Testing Conditional Independence of Discrete Distributions.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Differentially Private Identity and Equivalence Testing of Discrete Distributions.
Proceedings of the 35th International Conference on Machine Learning, 2018

Sample-Optimal Identity Testing with High Probability.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms.
Proceedings of the Conference On Learning Theory, 2018

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.
Proceedings of the Conference On Learning Theory, 2018

2017
Fourier-Based Testing for Families of Distributions.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Playing Anonymous Games using Simple Strategies.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Sample-Optimal Density Estimation in Nearly-Linear Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Communication-Efficient Distributed Learning of Discrete Distributions.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Being Robust (in High Dimensions) Can Be Practical.
Proceedings of the 34th International Conference on Machine Learning, 2017

Near-Optimal Closeness Testing of Discrete Histogram Distributions.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Learning Multivariate Log-concave Distributions.
Proceedings of the 30th Conference on Learning Theory, 2017

Testing Bayesian Networks.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
How Good is the Chord Algorithm?
SIAM J. Comput., 2016

Collision-based Testers are Optimal for Uniformity and Closeness.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Noise Stable Halfspaces are Close to Very Small Juntas.
Chicago J. Theor. Comput. Sci., 2016

The fourier transform of poisson multinomial distributions and its algorithmic applications.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Testing Shape Restrictions of Discrete Distributions.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Fast Algorithms for Segmented Regression.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Robust Estimators in High Dimensions without the Computational Intractability.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

A New Approach for Testing Properties of Discrete Distributions.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time.
Proceedings of the 29th Conference on Learning Theory, 2016

Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables.
Proceedings of the 29th Conference on Learning Theory, 2016

Learning Structured Distributions.
Proceedings of the Handbook of Big Data., 2016

2015
Testing Identity of Structured Distributions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Learning from satisfying assignments.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Differentially Private Learning of Structured Discrete Distributions.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions.
Theory of Computing, 2014

Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions.
SIAM J. Comput., 2014

Efficient density estimation via piecewise polynomial approximation.
Proceedings of the Symposium on Theory of Computing, 2014

A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Complexity of Optimal Multidimensional Pricing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Optimal Algorithms for Testing Closeness of Discrete Distributions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Testing k-Modal Distributions: Optimal Algorithms via Reductions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Learning mixtures of structured distributions over discrete domains.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Learning Sums of Independent Integer Random Variables.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Inverse Problems in Approximate Uniform Generation.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Learning poisson binomial distributions.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Learning k-modal distributions via testing.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficiency-Revenue Trade-Offs in Auctions.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

The Inverse Shapley Value Problem.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Efficiently Testing Sparse GF(2) Polynomials.
Algorithmica, 2011

Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Supervised design space exploration by compositional approximation of Pareto sets.
Proceedings of the 48th Design Automation Conference, 2011

Disjoint-Path Facility Location: Theory and Practice.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

How Good is the Chord Algorithm?.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Bounded Independence Fools Degree-2 Threshold Functions.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.
SIAM J. Comput., 2009

Bounded Independence Fools Halfspaces.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Improved Approximation of Linear Threshold Functions.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
Succinct approximate convex pareto curves.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Efficiently Testing Sparse GF(2) Polynomials.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Testing for Concise Representations.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems.
Proceedings of the Approximation, 2007


  Loading...