Speaker:  Ilias Diakonikolas, Professor, The University of Wisconsin–Madison

Abstract:

Robustness is a basic requirement for trustworthy machine learning, yet achieving it efficiently in high dimensions has long been a fundamental challenge. For decades, the prevailing view was that learning algorithms with strong robustness guarantees necessarily come with prohibitive computational cost, creating a sharp tension between statistical guarantees and algorithmic tractability. This talk describes a research program aimed at overcoming this barrier through an algorithmic theory of robust learning. 

 I will describe two interconnected threads within this research program. The first develops a unified framework for efficient robust high-dimensional estimation, including the first polynomial-time algorithms for several fundamental unsupervised learning tasks under adversarial corruption. The second studies supervised learning under noisy labels, with an emphasis on learning predictors with low-dimensional latent representations. I will conclude by discussing future directions, including robustness beyond worst-case corruption and the efficient learning of richer nonlinear representations.

Bio:

lias Diakonikolas is the Lubar Professor in the Department of Computer Sciences at UW Madison. He obtained a Diploma in electrical and computer engineering from the National Technical University of Athens and a Ph.D. in computer science from Columbia University where he was advised by Mihalis Yannakakis. Before moving to UW, he was an Andrew and Erna Viterbi Early Career Chair at USC and a faculty member at the University of Edinburgh. Prior to that, he was the Simons postdoctoral fellow in theoretical computer science at the University of California, Berkeley. His research is on the algorithmic foundations of massive data sets, in particular on designing efficient algorithms for fundamental problems in machine learning. He is a recipient of the ACM Grace Murray Hopper award, a Sloan Fellowship, an NSF CAREER Award, a Romnes Faculty Fellowship, a Google Faculty Research Award, a Marie Curie Fellowship, best paper awards at NeurIPS and COLT, the IBM Research Pat Goldberg Best Paper Award, and an honorable mention in the George Nicholson competition from the INFORMS society. Ilias wrote with Daniel Kane the textbook "Algorithmic High-dimensional Robust Statistics" published by Cambridge University Press.