2017 - Fellow of Alfred P. Sloan Foundation
Ilias Diakonikolas spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Estimator and Time complexity. He interconnects Matching and Function in the investigation of issues within Combinatorics. His studies deal with areas such as Simple, Distribution, Polynomial and Monotone polygon as well as Discrete mathematics.
His study explores the link between Polynomial and topics such as Boolean function that cross with problems in Representation. His work deals with themes such as Mixture model, Logarithm, Fraction and Robustness, which intersect with Algorithm. He has included themes like Covariance, Mathematical optimization, Upper and lower bounds, Pareto distribution and Spanning tree in his Time complexity study.
His primary scientific interests are in Combinatorics, Discrete mathematics, Algorithm, Upper and lower bounds and Distribution. Ilias Diakonikolas has researched Combinatorics in several fields, including Probability distribution, Total variation, Constant, Function and Polynomial. His Discrete mathematics research is mostly focused on the topic Boolean function.
His research in the fields of Time complexity overlaps with other disciplines such as Gaussian. The concepts of his Upper and lower bounds study are interwoven with issues in Uniform distribution, Multivariate statistics and Domain. His Distribution research includes elements of Property testing, Monotone polygon, Identity, Domain and Bounded function.
Ilias Diakonikolas spends much of his time researching Algorithm, Gaussian, Distribution, Combinatorics and Outlier. His studies in Algorithm integrate themes in fields like Fraction and Stationary point. His work carried out in the field of Distribution brings together such families of science as Covariance, Bounded function and Approximation algorithm.
His work deals with themes such as Upper and lower bounds, Polynomial, Cover and Marginal distribution, which intersect with Combinatorics. While the research belongs to areas of Upper and lower bounds, he spends his time largely on the problem of Exponential function, intersecting his research to questions surrounding Robustness. Ilias Diakonikolas interconnects Estimator, Applied mathematics and Constant in the investigation of issues within Outlier.
Ilias Diakonikolas focuses on Algorithm, Gaussian, Time complexity, Square and Combinatorics. His research in Algorithm intersects with topics in Upper and lower bounds and Stationary point. The Upper and lower bounds study combines topics in areas such as Condition number, Matrix, Learnability and Rank.
His Stationary point research focuses on Line and how it relates to Outlier, Robust statistics and Constant. Ilias Diakonikolas has included themes like Total variation, Explained sum of squares, Bounded function, Identifiability and Polynomial in his Constant study. His Square research is multidisciplinary, incorporating elements of Current, Distribution and Marginal distribution.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
Ilias Diakonikolas;Mihalis Yannakakis.
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques (2007)
Optimal algorithms for testing closeness of discrete distributions
Siu-On Chan;Ilias Diakonikolas;Gregory Valiant;Paul Valiant.
symposium on discrete algorithms (2014)
Sever: A Robust Meta-Algorithm for Stochastic Optimization
Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li.
international conference on machine learning (2018)
Robust Estimators in High Dimensions without the Computational Intractability
Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li.
foundations of computer science (2016)
Being Robust (in High Dimensions) Can Be Practical
Ilias Diakonikolas;Gautam Kamath;Daniel M. Kane;Jerry Li.
international conference on machine learning (2017)
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures
Ilias Diakonikolas;Daniel M. Kane;Alistair Stewart.
foundations of computer science (2017)
The inverse shapley value problem
Anindya De;Ilias Diakonikolas;Rocco A. Servedio.
international colloquium on automata languages and programming (2012)
Testing for Concise Representations
I. Diakonikolas;H.K. Lee;K. Matule;K. Onak.
foundations of computer science (2007)
A New Approach for Testing Properties of Discrete Distributions
Ilias Diakonikolas;Daniel M. Kane.
foundations of computer science (2016)
Recent Advances in Algorithmic High-Dimensional Robust Statistics.
Ilias Diakonikolas;Daniel M. Kane.
arXiv: Data Structures and Algorithms (2019)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, San Diego
Columbia University
Columbia University
MIT
MIT
Columbia University
Carnegie Mellon University
Apple (United States)
AT&T (United States)
Intel (United States)
University of Turin
University of Padua
Bedford Institute of Oceanography
University College Cork
Nagasaki University
University of Kent
Nagasaki University
University of Salerno
Griffith University
University of California, Berkeley
University of California, Riverside
Stanford University
University of California, San Diego
Université Paris Cité
University of Erlangen-Nuremberg