ACM Grace Murray Hopper Award
Greece - 2024
citation
For contributions to the field of algorithmic robust statistics by introducing new techniques to robustly estimate high-dimensional distributions along with a surprising variety of algorithmic applications
Diakonikolas' breakthrough work with collaborators beginning in 2016 gave the first efficient algorithms for learning the parameters of a high-dimensional distribution that are robust to arbitrary corruption in a constant fraction of data, with the constant independent of dimension. Subsequent work of Diakonikolas showed these new methods are not only of theoretical interest, but can be made practical, and can also be used to tackle more complex robust high-dimensional statistical problems, such as mixtures of distributions, in some cases being more efficient than even the prior state-of-the-art non-robust methods.
Diakonikolas' work broke barriers on the central question that stymied researchers since the 1960s in robust high-dimensional statistics. These problems have been widely studied in several communities, but were notoriously difficult and thought to be impossible to achieve with efficient algorithms. Indeed, Huber's book on robust statistics from nearly 30 years ago contained a remark essentially giving up on rigorous, provable methods to make progress on robust statistics for massive data, conjecturing that the community would have to settle for heuristics. Diakonikolas' work provides new algorithmically efficient robust statistical estimators that perform well for real world data that may significantly deviate from idealized modeling assumptions.
Diakonikolas has also played a pivotal role in disseminating his new ideas, including by co-authoring a textbook (with D. Kane) that is bound to become the textbook of choice for courses on this topic.