Sotabase

Career

· Lubar Professor, Department of Computer Sciences, University of Wisconsin-Madison2019–
· Andrew and Erna Viterbi Early Career Chair, Department of Computer Science, University of Southern California (USC)2016–2019
· PhD in Computer Science, Columbia University
· Diploma in Electrical and Computer Engineering, National Technical University of Athens
· Simons Postdoctoral Fellow in Theoretical Computer Science, University of California, Berkeley
· Faculty Member, University of Edinburgh

Publications (208)

Robust Estimators in High Dimensions without the Computational Intractability
IEEE Annual Symposium on Foundations of Computer Science · 2016
538
cited
Sever: A Robust Meta-Algorithm for Stochastic Optimization
International Conference on Machine Learning · 2018
309
cited
Being Robust (in High Dimensions) Can Be Practical
International Conference on Machine Learning · 2017
265
cited
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures
IEEE Annual Symposium on Foundations of Computer Science · 2016
243
cited
Optimal Algorithms for Testing Closeness of Discrete Distributions
ACM-SIAM Symposium on Discrete Algorithms · 2013
240
cited
Recent Advances in Algorithmic High-Dimensional Robust Statistics
arXiv.org · 2019
192
cited
Edinburgh Research Explorer a New Approach for Testing Properties of Discrete Distributions a New Approach for Testing Properties of Discrete Distributions
174
cited
Efficient Algorithms and Lower Bounds for Robust Linear Regression
ACM-SIAM Symposium on Discrete Algorithms · 2018
167
cited
List-decodable robust mean estimation and learning mixtures of spherical gaussians
Symposium on the Theory of Computing · 2017
155
cited
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
ACM-SIAM Symposium on Discrete Algorithms · 2017
139
cited
Bounded Independence Fools Halfspaces
2009 50th Annual IEEE Symposium on Foundations of Computer Science · 2009
134
cited
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM journal on computing (Print) · 2007
129
cited
Testing for Concise Representations
IEEE Annual Symposium on Foundations of Computer Science · 2007
129
cited
High-Dimensional Robust Mean Estimation in Nearly-Linear Time
ACM-SIAM Symposium on Discrete Algorithms · 2018
128
cited
Learning Poisson Binomial Distributions
Algorithmica · 2011
123
cited
Efficient density estimation via piecewise polynomial approximation
Symposium on the Theory of Computing · 2013
120
cited
Bounded Independence Fools Degree-2 Threshold Functions
IEEE Annual Symposium on Foundations of Computer Science · 2009
113
cited
Testing Identity of Structured Distributions
ACM-SIAM Symposium on Discrete Algorithms · 2014
105
cited
Learning geometric concepts with nasty noise
Symposium on the Theory of Computing · 2017
93
cited
Sample-Optimal Density Estimation in Nearly-Linear Time
ACM-SIAM Symposium on Discrete Algorithms · 2015
93
cited
Sotabase
Ilias Diakonikolas | Researcher Profile | Sotabase | Sotabase