2026 Ilias Diakonikolas: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	43	8053	7826	3456	3327	215	6757

Research.com Recognitions

2017 - Fellow of Alfred P. Sloan Foundation

Overview

Ilias Diakonikolas is affiliated with the University of Wisconsin-Madison in the United States. Their research primarily focuses on the field of Computer Science, with significant contributions to several subfields including Artificial Intelligence, Statistics and Probability, Computational Mechanics, Computer Vision and Pattern Recognition, and Control and Systems Engineering.

The main topics they address in their work include:

Machine Learning and Algorithms
Statistical Methods and Inference
Machine Learning and Data Classification
Sparse and Compressive Sensing Techniques
Advanced Statistical Methods and Models
Bayesian Modeling and Causal Inference
Face and Expression Recognition

Their recent papers cover a range of themes and are published in diverse venues. Selected publications are:

"Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs," 2020, published in Operations Research
"Robustly Learning any Clusterable Mixture of Gaussians," 2020, presented on arXiv (Cornell University)
"Outlier Robust Mean Estimation with Subgaussian Rates via Stability," 2020, presented on arXiv (Cornell University)
"Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks," 2020, presented on arXiv (Cornell University)
"Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals," 2020, presented on arXiv (Cornell University)

Frequent co-authors in their body of work include:

Daniel M. Kane
Nikos Zarifis
Christos Tzamos
Thanasis Pittas
Ankit Pensia

Their contributions are also visible across several publication venues, among which the most frequent are:

arXiv (Cornell University)
Operations Research
Communications of the ACM
SIAM Journal on Computing
IEEE Transactions on Information Theory

In addition to articles, they have published a book titled Algorithmic High-Dimensional Robust Statistics in 2023, through Cambridge University Press.

Ilias Diakonikolas has received recognition such as becoming a Fellow of the Alfred P. Sloan Foundation in 2017.

Best Publications

Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

Ilias Diakonikolas;Mihalis Yannakakis

639
Citations
Proceedings of the 33rd International Conference on Machine Learning (ICML 2016)

Jayadev Acharya;Ilias Diakonikolas;Schmidt , J. Li, L.

217
Citations
Sever: A Robust Meta-Algorithm for Stochastic Optimization

Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li

200
Citations
Robust Estimators in High-Dimensions Without the Computational Intractability

Ilias Diakonikolas;Gautam Kamath;Daniel Kane;Jerry Li

194
Citations
Robust Estimators in High Dimensions without the Computational Intractability

Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li

183
Citations
Optimal algorithms for testing closeness of discrete distributions

Siu-On Chan;Ilias Diakonikolas;Gregory Valiant;Paul Valiant

177
Citations
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

Ilias Diakonikolas;Daniel M. Kane;Alistair Stewart

171
Citations
Being Robust (in High Dimensions) Can Be Practical

Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li

162
Citations
A New Approach for Testing Properties of Discrete Distributions

Ilias Diakonikolas;Daniel M. Kane

147
Citations
Recent Advances in Algorithmic High-Dimensional Robust Statistics.

Ilias Diakonikolas;Daniel M. Kane

133
Citations
Testing for Concise Representations

I. Diakonikolas;H.K. Lee;K. Matule;K. Onak

120
Citations
Robustly learning a gaussian: getting optimal error, efficiently

Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li

114
Citations
Efficient density estimation via piecewise polynomial approximation

Siu-On Chan;Ilias Diakonikolas;Rocco A. Servedio;Xiaorui Sun

112
Citations
List-decodable robust mean estimation and learning mixtures of spherical gaussians

Ilias Diakonikolas;Daniel M. Kane;Alistair Stewart

101
Citations
Bounded Independence Fools Degree-2 Threshold Functions

Ilias Diakonikolas;Daniel M. Kane;Jelani Nelson

101
Citations
Learning poisson binomial distributions

Constantinos Daskalakis;Ilias Diakonikolas;Rocco A. Servedio

97
Citations
Bounded Independence Fools Halfspaces

Ilias Diakonikolas;Parikshit Gopalan;Ragesh Jaiswal;Rocco A. Servedio

94
Citations
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

Ilias Diakonikolas;Mihalis Yannakakis

89
Citations
Testing identity of structured distributions

Ilias Diakonikolas;Daniel M. Kane;Vladimir Nikishkin

87
Citations
High-dimensional robust mean estimation in nearly-linear time

Yu Cheng;Ilias Diakonikolas;Rong Ge

67
Citations
Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016)

Ilias Diakonikolas;Daniel M. Kane;Alistair Stewart

34
Citations
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently

Alistair Stewart;Ilias Diakonikolas;Gautam Chetan Kamath;Daniel M Kane

0
Citations

Frequent Co-Authors

Daniel M. Kane University of California, San Diego

Rocco A. Servedio Columbia University

Constantinos Daskalakis MIT

Mihalis Yannakakis Columbia University

Ankur Moitra MIT

Ronitt Rubinfeld MIT

Gregory Valiant Stanford University

Rong Ge Duke University

Vitaly Feldman Apple (United States)

Xi Chen Columbia University

External Links

Personal website of Ilias Diakonikolas Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a variety of pathways, including flexible online learning options. For those seeking a quick start or balancing work and study, online associate degree programs can be completed in as little as six months and offer a solid foundation for entry-level careers or future study.

Many students are also considering business and engineering degrees, which pair well with computer science skills. If you’re interested in areas like IT management or entrepreneurship, there are online business degree programs that are both accessible and affordable.

Affordability is a key concern for many learners. The cheapest online bachelor degree programs can make a four-year education attainable from anywhere, while still delivering accredited learning options.

Engineering remains a highly sought-after STEM field and shares many skills with computer science. Numerous online engineer degree offerings enable students to study at their own pace and customize their educational journey.